# Binary Tree Properties | Data Structure MCQs

1.

In a full binary tree if number of internal nodes is I, then number of nodes N are?

A.) N = 2I
B.) N = I + 1
C.) N = I – 1
D.) N = 2I + 1

N = 2I + 1

2.

In a full binary tree if there are L leaves, then total number of nodes N are?

A.) N = 2L
B.) N = L + 1
C.) N = L – 1
D.) N = 2L – 1

N = 2L – 1
Trace with respect to the diagram.

3.

Which of the following is not an advantage of trees?

A.) Hierarchical structure
B.) Faster search
C.) Router algorithms
D.) Undo/Redo operations in a notepad

4.

What is a complete binary tree?

A.) Each node has exactly zero or two children
B.) A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left
C.) A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right
D.) None of these

A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right

5.

Which of the following is correct with respect to binary trees?

A.) Let T be a binary tree. For every k ≥ 0, there are no more than 2k nodes in level k
B.) Let T be a binary tree with λ levels. Then T has no more than 2λ – 1 nodes
C.) Let T be a binary tree with N nodes. Then the number of levels is at least ceil(log (N + 1))
D.) All of the above