3. Binary search tree has best case run-time complexity of O(log n). What could be the
worst case? And why
A-O(n)
B-O(n²)
C-O(n³)
D-None of the above
Why?
4. Draw the heap (tree) corresponding to these elements: 20, 15, 18, 7, 9, 5, 12, 3, 6, 2
5. The sequence: 220, 15, 18, 7, 9, 5, 12, 3, 8, 2 is a max-heap.
True
False
Explain: