Algodoo

This is a model of a Binary Search Tree, a data structure seen in programming that allows for quick searching and sorting of data.

To use it place one of the fifty numbered balls in the blue funnel and wait until it stops in one of the black frames (a node).
Repeat this and watch as the tree grows.

The basic rules of this automation are:
- If a ball falls into an empty node it occupies it. (That node's value is now the number of the ball.)
- If a ball's value is less than the node value it falls to the left.
- If a ball's value is greater than the node value it falls to the right.

Keep in mind that the blue funnel is the only input point and that there is no way to reset without reloading. Also, only input one ball at a time.

There are only 5 levels and so only 2^5 - 1 = 31 possible nodes to fill. Balls that fall past the 5th level are deleted.

For more info see wiki page:
http://en.wikipedia.org/wiki/Binary_search_tree