Software is like sex: Itís better when itís free. Linus Torvalds
Red Black tree is self-balanced binary search tree with color information. The Red-Black tree nodes can be either red or black. The color ensures tree balance. The root node and all leaves node set with black color. When inserting new item in the red-black tree, the tree balanced based on these properties. The search operation similar to the binary search tree.
Insert values to Red Black Tree. Print items from Red Black Tree: 11 23 50 67 99 Find element 11 in the Red black tree