The minimum height of a binary search tree containing n nodes is
Answers
Answered by
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
English,
6 months ago
Science,
6 months ago
English,
6 months ago
Social Sciences,
11 months ago
Computer Science,
11 months ago
Math,
1 year ago
Math,
1 year ago