Skip to content
Related Articles

Related Articles

Improve Article

UGC-NET | UGC NET CS 2017 Jan – III | Question 33

  • Last Updated : 04 Apr, 2018

Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take ________ time in the worst case.
(A) O(1)
(B) O(lg n)
(C) O(n)
(D) O(n lg n)


Answer: (B)

Explanation: Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take O(lg n) time in the worst case.
For more information Refer:Red-Black Tree | Set 1 (Introduction)
Option (B) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :