Binary Search Tree Visualization
Interactive visualization of BST operations with royal elegance
About Binary Search Tree
A Binary Search Tree is a binary tree where for each node:
• All values in the left subtree are less than the node's value
• All values in the right subtree are greater than the node's value
• Both left and right subtrees are also binary search trees
Binary Search Tree Creation
Time Complexity
O(h)
Where h is the height of the tree
Worst Case Time
O(n)
When tree becomes skewed (like a linked list)
Best Case Time
O(log n)
When tree is balanced (height = log n)
Create a BST to begin visualization
BST will be displayed here