HOME
PARTNERS
CONTACT

Computer Science and Engineering Data Structures – 2 Experiments

Aim

Overview

Pretest

Red Black Tree

Aim Concept Structure and Properties Quiz

Red Black Tree Operations

Aim Rotation Insertion Deletion Search Demo Practice Exercise Quiz

Posttest

Red Black Tree

Choose difficulty:

Beginner

Intermediate

Advanced

1. What is the worst case Time Complexity for Searching, Insertion, and Deletion in a Red Black tree? Let ‘n’ be the number of nodes.

a: O (n) Explanation

Explanation

b: O (log n) Explanation

Explanation

c: O (1) Explanation

Explanation

d: None of these Explanation

Explanation

2. What is the use of Rotations in Red Black Trees?

a: To increase height of a subtree Explanation

Explanation

b: To decrease height of a subtree Explanation

Explanation

c: To maintain the maximum height as O (log n) Explanation

Explanation

d: To change the order of elements Explanation

Explanation

3. Let Z be the node to be inserted in the RB Tree. The uncle node of Z is black. Node Z, its parent node, and its grandparent node form a line. How would you insert it?

a: Color the node as black. Explanation

Explanation

b: Rotate the grandparent of Z and recolor the parent and grandparent of Z to fix violations. Explanation

Explanation

c: Rotate parent of Z Explanation

Explanation

d: Recolor grandparent of Z Explanation

Explanation

4. How would you delete a Red Leaf node?

a: Simply delete the leaf node Explanation

Explanation

b: Recolor the red node to black Explanation

Explanation

c: Delete the leaf node and recolor its parent to red Explanation

Explanation

d: None of these Explanation

Explanation

5. How to search for a node whose value is less than that of the root node?

a: Traverse recursively along the left subtree Explanation

Explanation

b: Traverse recursively along the right subtree Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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