Question

What is red black tree? define its properties?

Answer 1

A red–black tree is a kind of self-balancing binary search tree in computer science. 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.

Answer 2

A red black tree is a kind of self balancing binary search tree in computer science. Each nodes of a binary tree has an extra bit, and that bit is often interpreted as the colour red and black of a node. These colour bits are used to insure the tree remain approximately balanced during deletion.