Select a desired algorithm from the Algorithm menu.
Start with an empty tree, or choose "create a random tree" from the Algorithm menu,
Try inserting values into the tree
Try searching for values in the tree (search for ones that are present
and also try searching for ones that aren't in there)
Starting from an empty tree, try inserting values that are already ordered: 1, 2, 3, etc.
Starting from an empty tree, try inserting values that are reverse-ordered: 10, 9, 8, etc.
When execution pauses inside of an algorithm, press the "step" button to single-step through
the code or use the "play" button to resume continual execution.
You can drag the list nodes to new positions if you find the criss-crossing links confusing.
More detailed help is available from the Help menu.