Binary Search Tree Demo
Starting tree:
[15 [6 [3 [2] [4]] [8 [] [13 [9] []]]] [18 [17] [20]]]
Search
Search
Animates the comparison path.
Insert
Insert
Highlights the parent and inserts a new node.
Delete
Delete
Handles leaf, one-child, and two-child cases.
Reset tree
Clear highlights
Speed
normal node
current comparison
visited path
found / inserted
delete target
successor
Current tree
Operation
Ready.
Step log