Data Structures | Balanced Binary Search Trees | Question 13
Which of the following operations are used by Red-Black trees to maintain balance during insertion/deletion? a) Recoloring of nodes b) Rotation (Left and Right)
(A) Only a
(B) Only b
(C) Both a and b
(D) Neither a nor b
Both recoloring and rotation operations are used during insertion and deletion.
My Personal Notes arrow_drop_up
Please Login to comment...