Question

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.

Answer 1

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.