Saved Bookmarks
| 1. |
Max no of nodes in binary tree with height k, where root height is 0 |
|
Answer» Explanation: Binary search tree whose left and RIGHT subtrees differ in height by at most 1 UNIT is CALLED |
|