AlgoViz: Interactive Algorithm Visualization Tool

Binary Search Tree

Category: Tree / Graph | Time: O(log n) Avg | Space: O(h) Avg

Input Data

Visualization

Visual representation of the data structure

Enter tree data to start visualization.

About Binary Search Tree

A node-based binary tree data structure which has the following properties: the left subtree of a node contains only nodes with keys lesser than the node's key; the right subtree of a node contains only nodes with keys greater than the node's key; the left and right subtree each must also be a binary search tree.

Code Editor

The code is for reference. Editing it won't affect the visualization.

function buildBST(keys) {
  let root = null;
  keys.forEach(key => {
    root = insert(root, key);
  });
  return root;
}

function insert(node, key) {
  if (node === null) {
    return new Node(key);
  }
  if (key < node.key) {
    node.left = insert(node.left, key);
  } else if (key > node.key) {
    node.right = insert(node.right, key);
  }
  return node;
}

Frequently Asked Questions

About Binary Search Tree (BST)

What is a Binary Search Tree (BST)?

What is the time complexity for search, insert, and delete in a BST?

What causes a BST to become unbalanced?

How can you traverse a BST to get elements in sorted order?

What is the difference between a BST and a regular Binary Tree?

How do you find the minimum and maximum value in a BST?

What is the space complexity of a BST?

How does the deletion of a node with two children work in a BST?

Are BSTs stable for sorting?

What are self-balancing BSTs?

Where can I learn more?