A Binary Search Tree (BST) is a tree in which each node has only 2 children. A node's left child (if existent) must hold a value smaller than its own, and its right child (if existent) must hold a value larger than its own. An AVL tree is a self-balancing BST.

To toggle between the standard Binary Search Tree and the AVL Tree, select the respective header.

All available operations on the BST/AVL Tree will be shown here. Select an action and provide the necessary input, and the action will be animated in the visualisation area.

View the visualisation here!

As the action is being carried out, each step will be described in the status panel.

You can also follow the psuedocode highlights to trace the algorithm.

Control the animation with the player controls! Keyboard shortcuts are:
Left/right arrows: step backward/step forward
-/+: decrease/increase speed

Return to "Exploration Mode" to start exploring!