Question

The inorder and preorder traversal of a binary tree are

Answer 1

Explanation:

Maximum number of nodes will be there for a complete tree.

Number of nodes in a complete tree of height h = 1 + 2 + 2^2 + 2*3 + …. 2^h = 2^(h+1) – 1