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
Answer: (C)
Explanation:
Both recoloring and rotation operations are used during insertion and deletion.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.