Visualizing Binary Search Trees and Graph Traversals: BFS vs DFS Explained

Data Structures and Algorithms (DSA) form the foundation of computer science and technical coding interviews. Abstract data structures like Binary Search Trees (BSTs) and Graphs can be challenging to grasp through static code alone. Visualizing node insertions, rotations, and step-by-step traversals accelerates algorithmic intuition.

In this guide, we will analyze BST invariants, Depth-First Search (DFS), Breadth-First Search (BFS), and algorithm time complexities.

1. Binary Search Tree (BST) Invariants & Operations

A Binary Search Tree is a node-based binary tree data structure with a strict ordering property:

Left Subtree Keys < Parent Node Key < Right Subtree Keys

        (8)
       /   \
     (3)   (10)
     / \      \
   (1) (6)    (14)

Time Complexity Overview

2. Graph Traversal Paradigms: BFS vs. DFS

Traversing nodes in a graph requires systematic tracking of visited nodes to avoid infinite cycles:

Breadth-First Search (BFS) - Level Order Traversal

BFS uses a Queue (FIFO) data structure. It visits all immediate neighbor nodes before moving to the next distance tier:

// BFS Implementation (Queue-based)
function bfs(startNode) {
  const visited = new Set([startNode]);
  const queue = [startNode];

  while (queue.length > 0) {
    const node = queue.shift();
    console.log("Visited Node:", node.value);

    for (const neighbor of node.neighbors) {
      if (!visited.has(neighbor)) {
        visited.add(neighbor);
        queue.push(neighbor);
      }
    }
  }
}

Depth-First Search (DFS) - Deep Branch Traversal

DFS uses a Stack / Recursion (LIFO) data structure. It traverses to the deepest leaf node before backtracking:

// DFS Implementation (Recursive)
function dfs(node, visited = new Set()) {
  if (!node || visited.has(node)) return;
  
  visited.add(node);
  console.log("Visited Node:", node.value);

  for (const neighbor of node.neighbors) {
    dfs(neighbor, visited);
  }
}

3. Interactive DSA Visualizer Tools

Want to watch step-by-step animations of BST node insertions, deletions, BFS level sweeps, and DFS stack pushes? Check out our interactive DSA Visualizer on ToolMight Play.