Computer Science, asked by zajeeshz3501, 11 months ago

The minimum height of a binary search tree containing n nodes is

Answers

Answered by rk45125833k4
0

If there are n nodes in binary tree, maximum height of the binary tree is n-1 and minimum height is floor(log2n).

Similar questions