A Binary Search Tree (BST) is a hierarchical data structure where each node has at most two children. For every node, all values in the left subtree are smaller, and all values in the right subtree are larger than the node's value.
• Enter a value and click + to add nodes
• Drag nodes to reposition them
• Double-click nodes to delete them
• Use mouse wheel to zoom in/out
• Click and drag background to pan