What is the peculiarity of red black trees?

Options
- In red-black trees, the root do not contain data.
- In red-black trees, the leaf nodes are not relevant and do not contain data.
- In red-black trees, the leaf nodes are relevant but do not contain data.
- Both a and c above

CORRECT ANSWER : In red-black trees, the leaf nodes are not relevant and do not contain data.

Discussion Board
Red black tree

red-black trees, the leaf nodes are not relevant and do not contain data.

Sujata junare 07-28-2020 10:05 AM

Data Structure - Red Black Trees

A red–black tree is a kind of self-balancing binary search tree. Each node of the binary tree has an extra bit, and that bit is often interpreted as the color (red or black) of the node. These color bits are used to ensure the tree remains approximately balanced during insertions and deletions. In red-black trees, the leaf nodes are not relevant and do not contain data.

Prajakta Pandit 01-31-2017 05:56 AM

Write your comments


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)


Related Content

Advertisement
 
▲