左倾红黑树

左傾紅黑樹（LLRB）是一種類型的自平衡二元搜尋樹。它是紅黑樹的變體，並保證對操作相同漸近的複雜性，但被設計成更容易實現。

外部連結

論文

 Robert Sedgewick. Left-leaning Red–Black Trees . Direct link to PDF .
 Robert Sedgewick. Left-Leaning Red–Black Trees (slides).  Two versions:
 Robert Sedgewick. Left-Leaning Red–Black Trees (slides), from seminar at Dagstuhl in February 2008. Outdated. 
 Robert Sedgewick. Left-Leaning Red–Black Trees (slides), from April 2008; updated 
 Linus Ek, Ola Holmström and Stevan Andjelkovic. May 19, 2009. Formalizing Arne Andersson trees and Left-leaning Red–Black trees in Agda 
 Julien Oster. March 22, 2011. An Agda implementation of deletion in Left-leaning Red–Black trees
 Kazu Yamamoto. 2011.10.19. Purely Functional Left-Leaning Red–Black Trees

實現

其他

 Robert Segdewick. 20 Apr 2008. Animations of LLRB operations 
 Open Data Structures - Section 9.2.2 - Left-Leaning Red–Black Trees 
 Left-Leaning Red-Black Trees Considered Harmful 

樹結構