in DS
121 views
0 votes
0 votes
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)?
in DS
by
121 views

2 Comments

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

1 Answer

1 vote
1 vote

....

Answer:

Related questions