← lab index
Binary Search Tree
Insert, search, and delete — watch the tree evolve with animated traversal
BST: O(log n) average for insert/search/delete. Each node left child < parent < right child.
Ready — insert some values!
Insert
Search
Delete
Clear
Random 12
Balance (AVL)
Traversal:
In-order
Pre-order
Post-order
BFS