Menu

Question Discussion & Solution

MCQ

Q.

Which of the following remarks about Tree- indexing are true?

A

It is an m-ary tree

B

Successful searches should terminate in leaf nodes

C

Unsuccessful searches may terminate in leaf nodes level of the tree structure

D

All of these

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

Cartesian trees solve range minimum query problem in constant time

A

1

C

May be

D

Can't say

Discussion

MCQ

2.

What is the time complexity of level order traversal?

A

O(1)

B

O(n)

C

O(logn)

D

O(nlogn)

Discussion

MCQ

3.

In how many different ways can a tree be traversed?

A

Two ways

B

Three ways

C

One way

D

It cannot be traversed

Discussion

MCQ

4.

Cartesian trees are most suitable for?

A

searching

B

finding nth element

C

minimum range query and lowest common ancestors

D

self balancing a tree

Discussion

MCQ

5.

Which line connects any two nodes?

A

Edge

B

Depth

C

Level

D

None of the above

Discussion

More Data Structure Topics

Data Structure Basics

128 MCQs

Abstract data types

37 MCQs

Arrays

134 MCQs

Lists

166 MCQs

Stacks

165 MCQs

Queues

61 MCQs

Trees

133 MCQs

Binary Trees

120 MCQs

B Trees

8 MCQs

Heaps

36 MCQs

Hash based structures

7 MCQs

Graphs

157 MCQs

Mixed

10 MCQs