Menu

Question Discussion & Solution

MCQ

Q.

What are the operations that could be performed in O(logn) time complexity by red-black tree?

A

insertion, deletion, finding predecessor, successor

B

only insertion

C

only finding predecessor, successor

D

for sorting

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.

What is the time complexity of level order traversal?

A

O(1)

B

O(n)

C

O(logn)

D

O(nlogn)

Discussion

MCQ

2.

Binary search tree has best case run-time complexity of ?(log n). What could the worst case?

A

?(n)

B

?(n2)

C

?(n3)

D

None of the above

Discussion

MCQ

3.

To restore the AVL property after inserting a element, we start at the insertion point and move towards root of that tree. is this statement true?

A

1

C

May be

D

Can't say

Discussion

MCQ

4.

Which of the following options is an application of splay trees?

A

cache Implementation

B

networks

C

send values

D

receive values

Discussion

MCQ

5.

The number of different directed trees with 3 nodes are

A

2

B

3

C

4

D

5

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