The challenge
Return the values in root → left → right order.
The input is a binary tree, with no cycles or shared child nodes.
Example
Balanced example: [8, 4, 2, 6, 12, 10, 14].
Use the walkthrough below to inspect the input and each state change.
See Preorder, step by step
Follow the branches. Watch the state change.
View child pointers & node state
| Node | Value | Left | Right | State |
|---|---|---|---|---|
| A | 8 | B | C | — |
| B | 4 | D | E | — |
| C | 12 | F | G | — |
| D | 2 | null | null | — |
| E | 6 | null | null | — |
| F | 10 | null | null | — |
| G | 14 | null | null | — |
Inspect the input.
Labels identify node objects; numbers are their values. Left and right child pointers define the tree.
root = A:8View original input
A:8 [L:B, R:C] · B:4 [L:D, R:E] · C:12 [L:F, R:G] · D:2 [L:null, R:null] · E:6 [L:null, R:null] · F:10 [L:null, R:null] · G:14 [L:null, R:null]
Node IDs stay distinct even when values repeat. Pointer mutations update the diagram; removed nodes remain in the state table for reference.
Put it into code
A LIFO stack remembers the branches still waiting to be explored.
Nodes store value, left, and right. C++ uses C++17 or later.
from collections import deque
class Node:
def __init__(self, value, left=None, right=None):
self.value = value
self.left = left
self.right = right
def preorder(root):
out, stack = [], []
if root:
stack.append(root)
while stack:
node = stack.pop()
out.append(node.value)
if node.right:
stack.append(node.right)
if node.left:
stack.append(node.left)
return out
#include <algorithm>
#include <cmath>
#include <functional>
#include <limits>
#include <map>
#include <optional>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
struct Node {
long long value;
Node *left = nullptr, *right = nullptr;
explicit Node(long long v) : value(v) {}
};
vector<long long> preorder(Node* root) {
vector<long long> out;
stack<Node*> pending;
if (root) pending.push(root);
while (!pending.empty()) {
Node* node = pending.top(); pending.pop();
out.push_back(node->value);
if (node->right) pending.push(node->right);
if (node->left) pending.push(node->left);
}
return out;
}