Category:Red-black tree

From LiteratePrograms
Jump to: navigation, search

A red-black tree is a type of self-balancing binary search tree typically used to implement associative arrays. It has O(log n) worst-case time for each operation and is quite efficient in practice. Unfortunately, it's also quite complex to implement, requiring a number of subtle cases for both insertion and deletion.

Pages in category "Red-black tree"

The following 2 pages are in this category, out of 2 total.