AlgoViz: Interactive Algorithm Visualization Tool

In-order Traversal

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

Input Data

Visualization

Visual representation of the data structure

Enter tree data to start visualization.

About In-order Traversal

A tree traversal method that visits nodes in the order: left child, root, right child. For a Binary Search Tree, this traversal visits nodes in ascending order.

Code Editor

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

function traverse(node) {
  if (node) { // if node is not null
    traverse(node.left);
    
    // visit(node)
    visited_path.push(node.value);
    
    traverse(node.right);
  }
  // return from recursion
}

// final_path = visited_path

Frequently Asked Questions

About In-order Traversal

What is Tree Traversal?

What is In-order Traversal?

What is the difference between Breadth-First Search (BFS) and Depth-First Search (DFS)?

What is the time complexity for In-order traversal?

What is the space complexity for In-order traversal?

Can In-order traversal be done iteratively?

Where can I learn more?