# 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_______.

- In order.
- Preorder
- Post order.
- 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

- log 1 2 n −
- log 1 2 n +
- log 1 2 n +
- log 1 2 n −

Answer: C

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

- 4
- 8
- 16
- 32

Answer: C

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

- Preorder
- Inorder
- Postorder
- Any of the above

Answer: B

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

- log2 n
- n+1 .
- 2n
- 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?

- Leaf
- Branch
- Path
- Thread

Answer: D

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

- by replacing each empty sub tree by a new internal node
- by inserting an internal nodes for non-empty node
- by inserting an external nodes for non-empty node
- 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________.

- internal nodes on extended tree
- external nodes on extended tree
- vanished on extended tree
- None of above

Answer: A

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

- dn = n log2n
- dn = n log2n+1
- dn = log2n
- dn = log2n+1

Answer: D

10. What we call Binary trees with threads?

- Threaded trees
- Pointer trees
- Special trees
- Special pointer trees

Answer: A