ID NAME QUALITY USERS ACC % DIFFICULTY C I

#red-black-tree

A red-“black tree is a self-balancing binary search tree with an extra bit of data per node, its color, which can be either red or black

https://en.wikipedia.org/wiki/Red%E2%80%93black_tree https://www.cs.usfca.edu/~galles/visualization/RedBlack.html - visualisation tool https://www.youtube.com/watch?v=PhY56LpCtP4 - video lecture