Given a binary tree, return all root-to-leaf paths.

For example, given the following binary tree:

1 / \ 2 3 \ 5

All root-to-leaf paths are:

["1->2->5", "1->3"]

Skip to content
Binary Tree · Depth First Search · DFS · leetcode · Trees# Binary Tree Paths

Given a binary tree, return all root-to-leaf paths.

For example, given the following binary tree:

1 / \ 2 3 \ 5

All root-to-leaf paths are:

["1->2->5", "1->3"]