B

Binary Search Tree

Insert, search, and delete nodes in a binary search tree with real-time visualization.

Algorithms v1.0.0 45 uses
Nodes
0
Height
0
Last Op
—

About This Simulator

This simulator lets you build and manipulate a Binary Search Tree (BST) interactively. Watch nodes find their correct position as they're inserted, see how search traverses the tree, and observe how deletion handles different cases (leaf, one child, two children). The tree is drawn with color-coded highlights showing the current operation path.

How It Works

  1. 1 Type a number and click Insert to add it to the tree
  2. 2 Click Search to highlight the path taken to find a value
  3. 3 Click Delete to remove a node and watch the tree restructure
  4. 4 Click Random to insert a batch of random values
  5. 5 Click Clear to reset the tree
X Facebook LinkedIn Reddit WhatsApp Telegram Pinterest Email

More Simulators in Algorithms

R

Recursion Tree

Algorithms

Visualize recursive function call trees for Fibonacci, factorial, and more.
F

Finite State Machine

Algorithms

Build and run finite state machines — define states, transitions, and test input strings.
D

Database B-Tree

Algorithms

Visualize how databases use B-Trees for indexing — insert keys and watch the tree split and grow.

Translate

ESC