MathCS.org - Java

A Binary Search Tree (BST) is a standard data structure in Computer Science. This applet illustrates how insertion and deletion works for such trees.

• Click the button to start, then add random nodes to the tree.
• You can enter nodes with specific values instead f random values if you like.
• To delete a node, first click on the node to be deleted, then click on Remove Node