Binary Search Tree
BSTO(log n)A binary tree where every left child is smaller and every right child is larger than its parent. Right-click any node for quick actions.
Size
7
Height
3
Min
20
Max
80
root
searching
found / inserted
deleting
traversal
A binary tree where every left child is smaller and every right child is larger than its parent. Right-click any node for quick actions.