Tree in Data Structure

@T-Bone

This question paper focuses on the "Tree" of Data Structure. These Multiple Choice Questions (mcq) should be practiced to improve the Data Structure skills required for various interviews (campus interview, walk-in interview, company interview), placement, entrance exam and other competitive examinations.

This question paper focuses on the "Tree" of Data Structure. These Multiple Choice Questions (mcq) should be practiced to improve the Data Structure skills required for various interviews (campus interview, walk-in interview, company interview), placement, entrance exam and other competitive examinations.

Questions

1. The no of external nodes in a full binary tree with n internal nodes is?

Mark the correct option

2. Which of the following is a true about Binary Trees?

Mark the correct option

3. A Binary Tree can have

Mark the correct option

4. hich of the following is not an advantage of trees?

Mark the correct option

5. he difference between the external path length and the internal path length of a binary tree with n internal nodes is?

Mark the correct option

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:

Mark the correct option

7. eight of Height of a binary tree is

Mark the correct option

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

Mark the correct option

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

Mark the correct option

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?

Mark the correct option

Index of Questions