Teaching Rajasthan Basic Computer Instructor 2021 Mock Test Programming and Data Structure Binary Heap Binary Search Tree
Consider the following binary search tree T. A new node of value 12 is inserted into the T. What is the height of the tree after inserting node 12?
Hint:
The height of a binary tree is equal to the largest number of edges from the root to the most distant leaf node.
1
1
2
2
3
3
4
4