Red-Black Tree - is one of the self-balancing binary search trees, ensuring logarithmic growth of tree height with the number of nodes (N) and performing basic tree operations quickly: addition, deletion, and node search. Balance is achieved by introducing an additional attribute of the tree node - 'color'. This attribute can take one of two possible values - 'black' or 'red'

Properties:

• Insertion, deletion, and search operations do not exceed: O(log N)
• Memory usage - O(N)
• Insertion - no more than 2 rotations
• Deletion - no more than 3 rotations

• rb_tree.c
• RBExactQuery.png
• RBTreeInsert.png
• RBcreateTree.png