For a tree with just one node, the root node is the height of a binary tree is…
KVS PGT Computer Science · 2017 · PGT Computer Science · Computer Science subject component
For a tree with just one node, the root node is the height of a binary tree is defined to zero; if there are 2 levels of nodes, the height is 1 and so on. A Binary Search Tree is built according to the usual rules with the following six keys inserted one at a time as given: B, I, N, A, R, Y. What is the height of the tree?
- A.
5
- B.
2
- C.
3
- D.
4
Attempted by 825 students.
Sign up free to check your answer
Sign up freeLoading lesson…