Binary Search Tree Visualizer
Interactive visualization of BST operations with in-order, pre-order, and post-order traversals.
About Binary Search Trees
A Binary Search Tree is a node-based binary tree where each node has at most two children. For each node, all values in the left subtree are less than the node's value, and all values in the right subtree are greater.
Key Features:
- Search: O(log n) average, O(n) worst case
- Insertion: O(log n) average
- Deletion: O(log n) average
- Traversals: In-order, Pre-order, Post-order