+1 vote
in Data Structures & Algorithms I by (110k points)
Which special balanced binary search tree is used to store the nodes of auxiliary tree?

(a) Red – Black Tree

(b) Red – Brown Tree

(c) Red – Yellow Tree

(d) Red – Tango Tree

This intriguing question comes from Binary Trees in portion Binary Trees of Data Structures & Algorithms I

The question was posed to me during an interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct option is (a) Red – Black Tree

For explanation: The path starting from the root and following the path of preferred child node till the end of leaf node is known as preferred path. Nodes are stored in Red – Black tree for the representation of the preferred path.

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.