Question

In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most 2. if the height of the tree is h > 0, then the minimum number of nodes in the tree is mit

Answer 1

Answer:

In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most 2. if the height of the tree is h > 0, then the minimum number of nodes in the tree is mit