Question

10) A binary tree with N nodes is at least how deep?

How deep is it at most?

12) A Binary Search Tree is a binary tree with what additional property?

13) Beginning with an empty binary search tree, insert the following values 
in the order given.  Draw the tree at each step of the process.

1 10 5 20 22 7

14) Now delete the value 10 from the tree in question 13.  Show each of 
two possible configurations the resulting tree could have.


15) Traverse the value of 14 in post-order and in-order:
Post-order


In-order

17) A certain algorithm to determine the jitter in a data set consists of 2 steps: sorting data (n elements), using merge sort, and computing the sum of differences between all subsequent elements. What's the "big oh'ness" of that algorithm?

Answer 1

Please find the solutions below.


17) A certain algorithm to determine the jitter in a data set consists of 2 steps: sorting data (n elements), using merge sort, and computing the sum of differences between all subsequent elements. What's the "big oh'ness" of that algorithm?

The answer is: O(N²)