Given the root of a binary tree, return all root-to-leaf paths in any order.
root
A leaf is a node with no children.
[1, 100]
-100 <= Node.val <= 100
root = [1,2,3,null,5]
["1->2->5","1->3"]
root = [1]
["1"]