# 50+ Binary Tree Properties MCQs with FREE PDF

We have the best collection of Binary Tree Properties MCQs and answer with FREE PDF. These Binary Tree Properties MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

## Binary Tree Properties MCQs

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

#### 2. In a full binary tree if number of internal nodes is I, then number of leaves L are?

a) L = 2*I

b) L = I + 1

c) L = I – 1

d) L = 2*I – 1

Answer: L = I + 1

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

a) N = 2*I

b) N = I + 1

c) N = I – 1

d) N = 2*I + 1

Answer: N = 2*I + 1

#### 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) A tree In which all nodes have degree 2

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

a) Height

b) Depth

c) Length

d) Width

a) Height

b) Depth

c) Length

d) Width

#### 7. What is a full binary tree?

a) Each node has exactly zero or two children

b) Each node has exactly two children

c) All the leaves are at the same level

d) Each node has exactly one or two children

Answer: Each node has exactly zero or two children

#### 8. What is the average case time complexity for finding the height of the binary tree?

a) h = O(loglogn)

b) h = O(nlogn)

c) h = O(n)

d) h = O(log n)

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

a) N = 2*L

b) N = L + 1

c) N = L – 1

d) N = 2*L – 1

Answer: N = 2*L – 1

#### 10. Which of the following is incorrect 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) Let T be a binary tree with N nodes. Then the number of levels is at least floor(log (N + 1))

Answer: Let T be a binary tree with N nodes. Then the number of levels is at least floor(log (N + 1))