For a tree with just one node, the root node, the height of a binary tree is defined to be zero; if there are 2 levels of nodes, the height is 1 and so on. Binary search tree is built according to the usual rules with the following six keys, inserted one at a time given:
B, I, N, A, R, Y. what is the height of the tree?
1
2
2
4
3
3
4
5