Class comb.collections.RedBlackTree
Extends
comb.collections.Tree.
A RedBlack tree is a form of a self balancing binary tree.
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) |
Defined in: RedBlackTree.js.
- Methods borrowed from class comb.collections.Tree:
- clear, contains, every, filter, find, findGreaterThan, findLessThan, forEach, insert, isEmpty, map, print, reduce, reduceRight, remove, some, toArray, traverse, traverseWithCondition
- Methods borrowed from class comb.collections.Collection:
- concat, indexOf, join, lastIndexOf, slice, toString
Class Detail
comb.collections.RedBlackTree()
Documentation generated by
JsDoc Toolkit 2.4.0 on Tue Jan 31 2012 16:14:12 GMT-0600 (CST)
