1. In a complete binary search tree, what is the worst case complexity for finding a single key within the data structure? Select the tightest bound.

A. O(n 2 )

B. O(1)

C. O(log(n))

D. O(n)

E. O(n log(n))

2. In an unbalanced binary search tree, after inserting the keys in increasing order, what is the worst case complexity for finding a single key within the data structure? Select the tightest bound.

A. O(n 2 )

B. O(1)

C. O(log(n))

D. O(n)

E. O(n log(n))

3. Removing a single arbitrary key from the map, in an unbalanced binary search tree, requires time in the worst case.

A. O(n 2 )

B. O(1)

C. O(log(n))

D. O(n)

E. O(n log(n))

4. A post-order tree traversal produces key

A. With the largest key in the tree last in the list.

B. Only from the right subtree.

C. With all the trees leaves first.

D. With values first.