# MCQ - Tree in Data Structure

6. In a complete k-ary tree, every internal node has exactly k children or no child. The number of leaves in such a tree with n internal nodes is:

A. nk

B. (n – 1) k+ 1

C. n( k – 1) + 1

D. n(k – 1)

View Answer

Ans : C

Explanation: For an k-ary tree where each node has k children or no children, following relation holds L = (k-1)*n + 1 Where L is the number of leaf nodes and n is the number of internal nodes.

7.Height of Height of a binary tree is

A. MAX( Height of left Subtree, Height of right subtree)+1

B. MAX( Height of left Subtree, Height of right subtree)

C. MAX( Height of left Subtree, Height of right subtree)-1

D. None of the above

View Answer

Ans : A

Explanation: Height of Height of a binary tree is MAX( Height of left Subtree, Height of right subtree)+1.

8. Which of the following options is an application of splay trees ?

A. cache Implementation

B. networks

C. send values

D. receive values

View Answer

Ans : A

Explanation: Splay trees can be used for faster access to recently accessed items and hence used for cache implementations.

9. Suppose a complete binary tree has height h>0. The minimum no of leaf nodes possible in term of h is?

A. 2h -1

B. 2h -1 + 1

C. 2h -1

D. 2h +1

View Answer

Ans : C

Explanation: Suppose a complete binary tree has height h>0. The minimum no of leaf nodes possible in term of h is 2h -1.

10. A weight-balanced tree is a binary tree in which for each node. The number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the farthest leaf) of such a tree on n nodes is best described by which of the following?

A. log_{2} n

B. log_{4/3} n

C. log_{3} n

D. log_{3/2} n

View Answer

Ans : D

Explanation:No Explanation.

**Also Check : **

Discussion