121 views
The following numbers are inserted into an empty binary search tree in the given order: 1000, 452, 131, 15, 85, 75. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?

Ans given is 5 . it can be 6 also rite ? if we consider root as 1 instead of 0
Height is 5 And Level is 6

....