Vidyalelo
Data Structure · Q22

Advanced Trees (AVL, RedBlack, BTrees)

Programming · Data Structure · question 22

Q22

What is the time complexity of deleting a node from a Red-Black tree?

A.
O(1)
B.
O(log2 n)
C.
O(log n)
Answer
D.
O(n)

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board