Question

identify the valid red black tree
​

Answer 1

Answer:

A red-black tree is a kind of self-balancing binary search tree where each node has an extra bit, and that bit is often interpreted as the colour (red or black). These colours are used to ensure that the tree remains balanced during insertions and deletions. Although the balance of the tree is not perfect, it is good enough to reduce the searching time and maintain it around O(log n) time, where n is the total number of elements in the tree. This tree was invented in 1972 by Rudolf Bayer. 

Answer 2

$\huge\bold\red{➡ᴀɴՖᴡᴇʀ}$

Rules That Every Red-Black Tree Follows:

Every node has a colour either red or black. The root of tree is always black. There are no two adjacent red nodes (A red node cannot have a red parent or red child). Every path from a node (including root) to any of its descendant NULL node has the same number of black nodes.