20
       /    \
     06      48
       \    /  \
       12  28  61

To use the binary tree algorithm, you need to understand the public
functions of the object. Choose 'View Source' and view the script.
If you don't understand any of the source, you probably will not
have any use for this algorithm at this time.

This binary tree object can be implemented in place of using objects
of type Array(). The binary tree (in theory) is a more efficient
algorithm for ordered data when insertions and deletions are made
frequently. Since JavaScript is not a compiled language and the browsers
implementation of the data object of type Array is internal, there may
or may not be advantages in using a 'scripted' algorithm in place of
the browsers native code.

The one advantage JavaScript offers over C++ in this implementation would
be an educational advantage. It can be tested over the internet and does
not require a compiler.