Class comb.collections.AnderssonTree
Extends
comb.collections.Tree.
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) |
Defined in: AnderssonTree.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.AnderssonTree()
Documentation generated by
JsDoc Toolkit 2.4.0 on Tue Jan 31 2012 16:14:11 GMT-0600 (CST)
