Introduction

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:

Links

Video

Author: Shchekoldin Sergey (Щеколдин Сергей)
shchekoldin@gmail.com