Teaching HPSC Lecturer (Technical) Mock Test 2024 Programming and Data Structure Binary Heap Binary Search Tree
We create a binary search tree B1 by inserting the numbers 1, 2, 3, 4, 5 into an empty binary search tree. We create another binary search tree B2 by inserting the numbers into an empty binary search tree in the reverse order. What is the difference between the right-most element of B1 and the left-most element of B2?
1
1
2
3
3
4
4
2
5
Question Not Attempted