Binary Tree Paths
Given the root of a binary tree, return all root-to-leaf paths in any order.
A leaf is a node with no children.
Example 1
1
/ \
2 3
\
5Input
root = [1,2,3,null,5]Output
["1->2->5","1->3"]The root-to-leaf paths are
1->2->5 and 1->3.Example 2
1
Input
root = [1]Output
["1"]The only root-to-leaf path is
1.Constraints
- The number of nodes in the tree is in the range
[1, 100]. -100 <= Node.val <= 100