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 a height balanced binary tree?

a: A binary tree whose subtrees differ in height by at most one. Explanation

Explanation

b: Only an empty tree. Explanation

Explanation

c: Any binary tree whose subtrees differ in height by at least two. Explanation

Explanation

d: None of these Explanation

Explanation

2. Height balanced binary trees cannot be used to avoid formation of skew trees.

a: True. Explanation

Explanation

b: False. Explanation

Explanation

3. Which of the following is an AVL Tree?

a: A self-balancing tree with at least 1 height difference. Explanation

Explanation

b: Any tree with exactly three children. Explanation

Explanation

c: A self-balancing tree with at most 3 height difference. Explanation

Explanation

d: A self-balancing tree with at most 1 height difference. Explanation

Explanation

4. An empty tree is height balanced.

a: True Explanation

Explanation

b: False Explanation

Explanation

5. If there are two different leaf nodes of an AVL tree, then what is the maximum possible height difference between them?

a: 0 or 1 Explanation

Explanation

b: log(n), where n is the number of nodes Explanation

Explanation

c: n, where n is the number of nodes Explanation

Explanation

d: None of these Explanation

Explanation

6. If an AVL tree has n nodes, then what will be its maximum height?

a: log(n) Explanation

Explanation

b: n Explanation

Explanation

c: log(n/2) Explanation

Explanation

d: n/2 Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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