comb

comb

github

A Search tree that maintains the following properties

The left subtree of a node contains only nodes with keys less than the node's key.
The right subtree of a node contains only nodes with keys greater than the node's key.
Both the left and right subtrees must also be binary search trees.

Performance

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

Extends

comb.collections.Tree

Constructor

Defined collections/BinaryTree.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