Binary Trees Questions

MCQ bookmark_border

111.

What are the worst case and average case complexities of a binary search tree?

A

O(n), O(n)

B

O(logn), O(logn)

C

O(logn), O(n)

D

O(n), O(logn)

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

112.

What are the conditions for an optimal binary search tree and what is its advantage?

A

The tree should not be modified and you should know how often the keys are accessed, it improves the lookup cost

B

You should know the frequency of access of the keys, improves the lookup time

C

The tree can be modified and you should know the number of elements in the tree before hand, it improves the deletion time

D

None of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

113.

Why we need to a binary tree which is height balanced?

A

to avoid formation of skew trees

B

to save memory

C

to attain faster memory access

D

to simplify storing

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

114.

What is a threaded binary tree traversal?

A

a binary tree traversal using stacks

B

a binary tree traversal using queues

C

a binary tree traversal using stacks and queues

D

a binary tree traversal without using stacks and queues

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

115.

What are the disadvantages of normal binary tree traversals?

A

there are many pointers which are null and thus useless

B

there is no traversal which is efficient

C

complexity in implementing

D

improper traversals

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

116.

What may be the content of a node in threaded binary tree?

A

leftchild_pointer, left_tag, data, right_tag, rightchild_pointer

B

leftchild_pointer, left_tag

C

leftchild_pointer, left_tag, right_tag, rightchild_pointer

D

leftchild_pointer, left_tag, data

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

117.

What are null nodes filled with in a threaded binary tree?

A

inorder predecessor for left node and inorder successor for right node information

B

right node with inorder predecessor and left node with inorder successor information

C

they remain null

D

some other values randomly

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

118.

What is wrong with below code for inorder traversal of inorder threaded binary tree:

inordertraversal(threadedtreenode root):
   threadedtreenode q = inorderpredecessor(root)
   while(q!=root):
   q=inorderpredecessor(q)
   print q.data

A

inordersuccessor instead of inorderpredecessor must be done

B

code is correct

C

it is code for post order

D

it is code for pre order

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

119.

Depth First Search is equivalent to which of the traversal in the Binary Trees?

A

Pre-order Traversal

B

Post-order Traversal

C

Level-order Traversal

D

In-order Traversal

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

120.

Breadth First Search is equivalent to which of the traversal in the Binary Trees?

A

Pre-order Traversal

B

Post-order Traversal

C

Level-order Traversal

D

In-order Traversal

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion