AlgoViz: Interactive Algorithm Visualization Tool

Pre-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 Pre-order Traversal

A tree traversal method that visits nodes in the order: root, left child, right child. It's used to create a copy of the tree.

Code Editor

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

function traverse(node) {
  if (node) {
    // visit(node)
    visited_path.push(node.value);

    traverse(node.left);
    traverse(node.right);
  }
  // return from recursion
}

// final_path = visited_path

Frequently Asked Questions

About Pre-order Traversal

What is Pre-order Traversal?

How does Pre-order traversal work?

What is a key use case for Pre-order traversal?

Where can I learn more?