Trees Questions

MCQ bookmark_border

121.

What is the disadvantage of using splay trees?

A

height of a splay tree can be linear when accessing elements in non decreasing order.

B

splay operations are difficult

C

no significant disadvantage

D

splay tree performs unnecessary splay when a node is only being read

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

122.

The null left pointer pointing to predecessor and null right pointer pointing to successor. how many types of threaded tree are possible with this convention?

A

inorder, postorder, preorder traversals

B

inorder

C

postorder

D

preorder

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

123.

What are double and single threaded trees?

A

when both left, right nodes are having null pointers and only right node is null pointer respectively

B

having 2 and 1 node

C

using single and double linked lists

D

using heaps and priority queues

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

124.

What is the location of parent node for any arbitary node i?

A

(i/2) position

B

(i+1)/ position

C

floor(i/2) position

D

ceil(i/2) position

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

125.

What is the complexity of given function of insertion.

A

O(logn)

B

amortized O(1)

C

O(n)

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

126.

Which of these operations have same complexities?

A

Insertion, find_min

B

Find_min, union

C

Union, Insertion

D

Deletion, Find _max

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

127.

What is direct addressing?

A

Distinct array position for every possible key

B

Fewer array positions than keys

C

Fewer keys than array positions

D

None of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

128.

What is the search complexity in direct addressing?

A

O(n)

B

O(logn)

C

O(nlogn)

D

O(1)

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

129.

When is it appropriate to use direct addressing?

A

When the array is comparatively large

B

When the universe U of keys is reasonably small

C

When the universe U of keys is reasonably large

D

When the array is comparatively small

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

130.

What is the time complexity to insert an element into the direct address table?

A

O(n)

B

O(logn)

C

O(nlogn)

D

O(1)

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion