热门问题
时间线
聊天
视角
左傾紅黑樹
来自维基百科,自由的百科全书
Remove ads
左傾紅黑樹(英語:Left-leaning red–black tree,縮寫:LLRB)是一種類型的自平衡二元搜尋樹。它是紅黑樹的變體,並保證對操作相同漸近的複雜性,但被設計成更容易實現。
![]() |
Remove ads
Remove ads
外部連結
- Robert Sedgewick. Left-leaning Red–Black Trees (頁面存檔備份,存於網際網路檔案館). Direct link to PDF (頁面存檔備份,存於網際網路檔案館).
- Robert Sedgewick. Left-Leaning Red–Black Trees (slides). Two versions:
- 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 (頁面存檔備份,存於網際網路檔案館)
Remove ads
Wikiwand - on
Seamless Wikipedia browsing. On steroids.
Remove ads