← Back to DSA Visualizer

Binary Search Tree Visualization

A Binary Search Tree (BST) is a binary tree where the left child is smaller than the parent, and the right child is larger. This property enables efficient search, insertion, and deletion operations.

Tree Height

0

Node Count

0

Comparisons

0

Valid BST

✓

Operation

None

BST Operations

Search

Tree Management

Analysis

BST Node
Current/Highlighted
Search Path
🔍

Empty BST

Insert some nodes or generate a random BST to get started!

Binary Search Tree Properties

BST Properties:

  • • Left subtree: All values < parent
  • • Right subtree: All values > parent
  • • Inorder traversal: Gives sorted sequence
  • • Search/Insert/Delete: O(h) where h is height

Time Complexities:

  • • Search: O(log n) average, O(n) worst
  • • Insert: O(log n) average, O(n) worst
  • • Delete: O(log n) average, O(n) worst
  • • Space: O(n) for storage