MuhammadLab

Binary Search Tree Visualizer — Insert, Search, Delete

Learn BST ordering (left smaller, right larger), insertion/search paths, and deletion cases with traversal outputs.

Interactive learning • Step-by-step operations • Visual explanations

Controls
Pick an operation, then execute and step through.
BST
Empty BST
Code-like representation
Connect the visual model to what you’d write in code.
bst
BST inorder: []
Step-by-step explanation
Watch intermediate reasoning, not just the final result.
Step 0 / 0
Choose an operation and click Execute to generate steps.
Teaching notes
Short, beginner-friendly reminders.
Learning mode
A BST keeps smaller values on the left and larger values on the right.
Inorder traversal visits values in sorted order (for a BST).
Operation history
Track what you tried and what happened.
No operations yet.
Data Structures Visualizers
Explore the family of visualizers.
python dictionary visualizerstack visualizerqueue visualizerset visualizerlist array visualizerlinked list visualizertree visualizerbst visualizerheap visualizergraph visualizerdeque visualizerpriority queue visualizer

Processed Locally

Your file never leaves your device. Everything is processed in your browser — we never see or store your data.

Related Tools

Tree Visualizer — Hierarchy, Levels & Traversal

Learn tree concepts (root/parent/child/leaf) and traversals with step-by-step highlights.

Heap Visualizer — Min-Heap / Max-Heap

Learn heaps as complete binary trees stored in arrays. Bubble-up and heapify-down steps included.

List / Array Visualizer — Indexes, Insert, Remove

Understand indexed access and shifting on insert/remove with a clean array-cell view.

Big-O Complexity Explainer — Time & Space

Learn and compare time complexity notations with examples, code, and a complexity comparison table.