rbtq

rbtq

University

5 Qs

quiz-placeholder

Similar activities

Kuis 2 - ASD -A

Kuis 2 - ASD -A

University

10 Qs

Data Structure

Data Structure

University

10 Qs

Tree

Tree

University

10 Qs

BCSC0006 Trees

BCSC0006 Trees

University

10 Qs

Tree Data Structure

Tree Data Structure

University

10 Qs

Quiz AVL's Tree

Quiz AVL's Tree

University

7 Qs

Lecture 02

Lecture 02

University

10 Qs

BAN2022_CH4: Classification Part IV Decision Tree (EOC)

BAN2022_CH4: Classification Part IV Decision Tree (EOC)

University

10 Qs

rbtq

rbtq

Assessment

Quiz

Computers

University

Hard

Created by

A K

Used 8+ times

FREE Resource

5 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

If the node of the red black tree to be deleted is red node

Rotation and color swapping needed

Only rotation is involved

Only color swapping is needed

none of the options is true

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

While insertion in the red black tree if the parent's sibling is red

Rotation and color swapping is needed

Rotation is needed

Only color swapping is needed

None of the options is true

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

While deletion of DB if the sibling is black and both it's children are red then

Color of nearest child of black sibling does not matter

Color of farthest child of black sibling does not matter

We have different rule for this case

none of the options are true

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

During double black rotation the parent always rotates

in the direction of DB node

Away from DB node

Depends on the case

none of the options are correct

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which tree is used when fewer insertions and lots of searching is involved

AVL Tree

Reb Black Tree

Any variant of BS Tree

None of the options are correct