Skip to main content

9. Binary Tree Inorder Traversal

easyAsked at Roblox

Return the in-order traversal of a binary tree's node values.

By Alex Chen, Founder, InterviewChamp.AI · Last verified

Problem

Given the root of a binary tree, return the in-order traversal of its nodes' values. The expected order is left subtree, current node, then right subtree.

Constraints

  • 0 <= number of nodes <= 100
  • -100 <= Node.val <= 100

Examples

Example 1

Input
root = [1,null,2,3]
Output
[1,3,2]

Example 2

Input
root = []
Output
[]

Approaches

1. Recursion

Recurse left, visit node, recurse right.

Time
O(n)
Space
O(h)
function inorder(root, out=[]) {
  if (!root) return out;
  inorder(root.left, out);
  out.push(root.val);
  inorder(root.right, out);
  return out;
}

Tradeoff:

2. Iterative with explicit stack

Push lefts onto a stack, pop and visit, then move right. Avoids recursion limits for deep trees.

Time
O(n)
Space
O(h)
function inorderTraversal(root) {
  const out = [], stack = [];
  let cur = root;
  while (cur || stack.length) {
    while (cur) { stack.push(cur); cur = cur.left; }
    cur = stack.pop();
    out.push(cur.val);
    cur = cur.right;
  }
  return out;
}

Tradeoff:

Roblox-specific tips

Roblox interviewers like seeing the iterative form because the same pattern walks Workspace/Instance hierarchies in Roblox Studio without blowing the Lua stack.

Solve it now

Free. No sign-up. Python and JavaScript run instantly in your browser.

Output

Press Run or Cmd+Enter to execute

Practice these live with InterviewChamp.AI

Drill Binary Tree Inorder Traversal and other Roblox interview questions under real-loop conditions with instant feedback on your reasoning, complexity claims, and code.

Practice these live with InterviewChamp.AI →