We can sort a given set of n numbers by first building a binary search tree containing these numbers (using tree-insert repeatedly to insert the numbers one by one) and then printing the numbers by an inorder tree walk. what are the worstcase and best-case running times for this sorting algorithm?

5   1/4   miles per hour

step-by-step explanation:

15   3/4 / 3 = 5   1/4

u = -(6/7)w

step-by-step explanation:

place all values with 'u' on one side of the equation.

4u + 8w = - 3u + 2w

4u + 3u = 2w - 8w

further simplify the equation by solving the addition and subtraction.

7u = - 6w

make 'u' the independent variable by placing its co-efficient on the right-hand side.

u = - (6/7)w

probably .5

i can on others if necessary.

part a: 1.08

part b: 27.59