左倾红黑树

维基百科,自由的百科全书
跳到导航 跳到搜索

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

外部連結[编辑]

論文[编辑]

實現[编辑]

作者 時間 語言 變體 附註 連結
Robert Sedgewick, rkapsi 2008 Java From this Sedgewick paper Left-leaning Red–Black Tree (LLRB)[永久失效連結] -- this code has errors, see github comments
David Anson 2 Jun 2009 C# Maintaining balance: A versatile red-black tree implementation for .NET
kazu-yamamoto 2011 Haskell llrbtree (Data.Set.LLRBTree)
gradbot 2010 F# f-sharp-llrbt[永久失效連結]
Lee Stanza 2010 C Includes discussion Balanced Trees, Part 4: Left Leaning Red–Black Trees
Jason Evans 2010 C 2-3 rb.h
Nicola Bortignon December 8, 2010 ActionScript 3 AS3 implementation and discussion
william at 25thandClement.com 2011 C 2-3 variant using iteration with parent pointers llrb.h: Left-leaning Red–Black Tree
Maciej Piechotka 2009 Vala Gee.TreeMap
Petar Maymounkov 2010 Go GoLLRB
Sebastien Chapuis 2015 C C - Left-leaning rbtree implementation

其他[编辑]