comb

comb

github

Andersson Trees are a version of a balanced Binary tree, while similar to RedBlack Trees the balancing is not as strict.

Performance

	Best	Worst
space	O(n)	O(n)
Search	O(log n)	O(log n)
Insert	O(log n)	O(log n)
Delete	O(log n)	O(log n)

Extends

comb.collections.Tree

Constructor

Defined collections/AnderssonTree.js

License

MIT https://github.com/C2FO/comb/raw/master/LICENSE

Meta

Code: git clone git://github.com/C2FO/comb.git
Website: http://c2fo.com
Twitter: http://twitter.com/c2fo - 877.465.4045