Teaching HPSC Lecturer (Technical) Mock Test 2024 Programming and Data Structure Binary Heap Binary Search Tree
Consider that N distinct elements (N >= 3) are inserted into an initially empty binary search tree (BST). Which of the following statements are true?
1
The worst case height of the resulting BST is log2N
2
None of the above
3
Swapping the order of insertion of any two elements can always half the height of the resulting BST.
4
Consider that a given order of insertion results in a BST of height N. One can always find two elements in the original order where swapping the order of insertion of the two elements can half the height of the resulting BST.
5
Question Not Attempted