Workspace

Problem workspace

3 day streakD

Root-to-Leaf Paths

EasyTreesPaths & ancestors

The challenge

Return every complete root-to-leaf path in left-to-right order.

A leaf has no children. Let L be the total number of values copied into all returned paths.

Example

Balanced example: [8,4,2], [8,4,6], [8,12,10], [8,12,14]. A single node gives one one-value path.

Use the walkthrough below to inspect the input and each state change.

See Root-to-leaf paths, step by step

Follow the branches. Watch the state change.

7 input nodesL = left · R = right
Inspect the input.Labels identify node objects; numbers are their values. Left and right child pointers define the tree. Node labels identify objects; numbers show their values. The pointer table below provides the same structure in text.LRLRLR2D4B6E8A · root10F12C14G
CurrentProcessedPending
View child pointers & node state
Node state · null means no child
NodeValueLeftRightState
A8BC—
B4DE—
C12FG—
D2nullnull—
E6nullnull—
F10nullnull—
G14nullnull—
Step 01 / 23

Inspect the input.

Labels identify node objects; numbers are their values. Left and right child pointers define the tree.

root = A:8
View 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

Share one working path during recursion and copy it only at a leaf.

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 root_paths(root):
    out, path = [], []
    def visit(node):
        if node is None:
            return
        path.append(node.value)
        if node.left is None and node.right is None:
            out.append(path.copy())
        else:
            visit(node.left)
            visit(node.right)
        path.pop()
    visit(root)
    return out

A good place to start

Explore a pattern

A little guidance

Start with a pattern, read through a problem, and mark it solved when the idea clicks. Save anything you want to revisit.

New tutorials are added one at a time. Your bookmarks and solved checkmarks stay in this browser.

Explore the roadmap