Computer Science, asked by Kirtk4549, 11 months ago

Max no of nodes in binary tree with height k, where root height is 0

Answers

Answered by Anonymous
1

Explanation:

Binary search tree whose left and right subtrees differ in height by at most 1 unit is called

Answered by kanika575
0

Answer:

In which left and right subtrees differ by 1 unit

Similar questions