UTpaper

Free mock tests & test series

Question 46Asked in UGC NET Computer Science, June 2017 (Paper II & III, Selected Questions)

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…

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.
  1. AO(1)
  2. BO(lg n)
  3. CO(n)
  4. DO(n lg n)
Show answerHide answer

Correct answer: (B) O(lg n)

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.

From UGC NET Computer Science PYQ, June 2017 (Paper II & III, Selected Questions)

This is question 46 of UGC NET Computer Science PYQ, June 2017 (Paper II & III, Selected Questions). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.