DS – mcq on Binary Trees

The following are the objective questions on the topic related to Binary Trees in data structures using C/C++.

1.A binary tree stored using linked representation can be converted to its mirror image by traversing it in_______.

1. In order.
2. Preorder
3. Post order.
4. Any order.

Answer: B

2.The depth dn, of complete binary tree of n nodes, where nodes are labeled from 1 to n with root as node 1 and last leaf node as node n is

1. log 1 2 n −
2. log 1 2 n +
3. log 1 2 n +
4. log 1 2 n −

Answer: C

3. The number of unused pointers in a complete binary tree of depth 5 is________.

1. 4
2. 8
3. 16
4. 32

Answer: C

4. We can determine a Binary tree as a Binary Search Tree by traversing it in

1. Preorder
2. Inorder
3. Postorder
4. Any of the above

Answer: B

5.A full binary tree with ‘n’ non-leaf nodes contains _____ nodes.

1. log2 n
2. n+1 .
3. 2n
4. 2n+l

Answer: D

6. What are that special pointers called in a binary tree where certain entries are replaced where point to nodes higher in the tree for efficiency?

1. Leaf
2. Branch
3. Path
4. Thread

Answer: D

7.A binary tree can easily be converted into a 2-tree/Binary tree_____.

1. by replacing each empty sub tree by a new internal node
2. by inserting an internal nodes for non-empty node
3. by inserting an external nodes for non-empty node
4. by replacing each empty sub tree by a new external node

Answer: D

8. When converting binary tree into extended binary tree, all the original nodes in binary tree are________.

1. internal nodes on extended tree
2. external nodes on extended tree
3. vanished on extended tree
4. None of above

Answer: A

9.The depth of a complete binary tree is given by

1. dn = n log2n
2. dn = n log2n+1
3. dn = log2n
4. dn = log2n+1

Answer: D

10. What we call Binary trees with threads?

1. Threaded trees
2. Pointer trees
3. Special trees
4. Special pointer trees

Answer: A