Left-leaning red–black tree
Self-balancing binary search tree data structure / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Left-leaning red–black tree?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
A left-leaning red–black (LLRB) tree is a type of self-balancing binary search tree, introduced by Robert Sedgewick. It is a variant of the red–black tree and guarantees the same asymptotic complexity for operations, but is designed to be easier to implement.[1]
Quick Facts Type, Invented ...
Left-leaning red–black tree | ||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Type | tree | |||||||||||||||||||||||
Invented | 2008 | |||||||||||||||||||||||
Invented by | Robert Sedgewick | |||||||||||||||||||||||
|
Close