26. If the post-order traversal gives a b - c d * + then the label of the nodes 1, 2, 3 ... will be

- Option : A
- Explanation : Post-order traversal yields 4, 5, 2, 6, 7, 3, 1. Comparing with a, b, -, c, d, *, +, we get the labels of nodes 1, 2, 3, 4, 5, 6, 7 ans +, -, *, a, b, c, d respectively.

You must be logged in to post a comment.

27. Consider the following tree

- Option : D
- Explanation : If it is to be used for sorting label of left child should be less than the label of the current node. Coming down the tree we get left child of node labeled 10 as the correct slot for 8.

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : B
- Explanation : A strictly binary tree with 'n' leaves must have (2n-1) nodes. Verify for some small 'n'. This can be proved by the principle of mathematical induction.

You must be logged in to post a comment.

You must be logged in to post a comment.

30. The depth of a complete binary tree with 'n nodes is (log is to be base two)

- Option : A
- Explanation : If the depth is d, the number of nodes n will be 2 (d+1)-1

So, n+1 = 2(d+1) or d = log (n+1)-1

You must be logged in to post a comment.

You must be logged in to post a comment.

You must be logged in to post a comment.