+1 vote
in Data Structures & Algorithms I by (110k points)
Which of the following is an application of Red-black trees and why?

(a) used to store strings efficiently

(b) used to store integers efficiently

(c) can be used in process schedulers, maps, sets

(d) for efficient sorting

I'd like to ask this question from Red Black Tree topic in section Binary Trees of Data Structures & Algorithms I

This question was addressed to me in an online interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
The correct option is (c) can be used in process schedulers, maps, sets

Easiest explanation - RB tree is used for Linux kernel in the form of completely fair scheduler process scheduling algorithm. It is used for faster insertions, retrievals.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.