Binary Trees Questions

MCQ bookmark_border

101.

In a binary search tree, which of the following traversals would print the numbers in the ascending order?

A

Level-order traversal

B

Pre-order traversal

C

Post-order traversal

D

In-order traversal

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

102.

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

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

103.

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 the mentioned

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

104.

What is the 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)

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

105.

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

A

L = 2I

B

L = I + 1

C

L = I

D

L = 2I

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

106.

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

D

N = 2I + 1

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

107.

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

D

N = 2L

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

108.

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?

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 mentioned

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

109.

Which of the following is false about a binary search tree?

A

The left child is always lesser than its parent

B

The right child is always greater than its parent

C

The left and right sub-trees should also be binary search trees

D

None of the mentioned

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

110.

What is the speciality about the inorder traversal of a binary search tree?

A

It traverses in a non increasing order

B

It traverses in an increasing order

C

It traverses in a random fashion

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion