Class comb.collections.BinaryTree

Extends comb.collections.Tree.

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.

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