Red Black Tree

Choose difficulty:

Beginner

Intermediate

Advanced

1. What is the special or unique property of Red Black Trees that makes it different from a normal Binary search tree?

a: They use colors Red and Black to represent nodes. Explanation

Explanation

b: They are height balanced Explanation

Explanation

c: They guarantee a O (log n) worst case time complexity for Insertion and Deletion Explanation

Explanation

d: None of these Explanation

Explanation

2. If a node is of Red color, then what can be determined about its parent node?

a: Parent node is the Root node Explanation

Explanation

b: Color of parent node is Black Explanation

Explanation

c: Color of parent node is Red Explanation

Explanation

d: None of these Explanation

Explanation

3. Why have Red Black trees been invented and used?

a: There was a need for a type of balanced tree that can be used to organize comparable data. Explanation

Explanation

b: There was a need for a colored balanced tree Explanation

Explanation

c: There was a need for a type of tree data structure that had O (log n) worst case time complexity for Insertion and Deletion Explanation

Explanation

d: None of these Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)