Question

Question: Algorithms and data structures | Red black trees

Create red black trees based on given conditions

Note: (A, B, C, D, E) should be the only nodes used

B is the root node

Complete the following four cases by drawing the tree

Assume: x is black and is a right child.

The case where x is black and a right left is similar (symmetric).

Four cases:

x’ sibling w is red.

x’s sibling w is black; both children of w are black.

x’s sibling w is black; right child of w is red, left child black.

x’s sibling w is black; left child of w is red.

COMPLETE:

x is a black right child: Case 1

x’ sibling w is red.

Right rotate on B (parent) ; change colors of B (parent) and D (sibling).

Transform to Case 2, 3, or 4 (where w is black).

----------

x is a black right child : Case 2

x’s sibling w is black; both children of w are black.

Move x up, and change w’s color to red.

If new x is red, change it to black; else, repeat.

-----------

x is a black right child : Case 3

x’s sibling w is black; w’s right child is red (C) , left child black.

Left rotate on w (D); switch colors of C (child) and D (sibling).

C (child) becomes the new w.

Transform to Case 4.

-----------

X is a black Right child : Case 4

x’s sibling w is black; w’s left child (E) is red.

Right rotate on B (parent) ; switch colors of B (parent) and D (sibling) ;

change E (child) to black.

Done!

Answer 1

There are total 4 classes. Student class is inherited and publicly accessed by 2 more classesFirstYearStudent and SecondYearStudent and there is 1 more School class. So total 4 classes

In main function when School object is called 100 constructors from FirstYearStudent of Student and 100constructors from SecondYearStudent of Student and 1 of school constructor and 100 constructor of FirstYearStudent itself and 100 constructors of SecondYearStudent which means s a total of 401 objects will be created because 401 will be created.