1
/**
2
 * Definition for a binary tree node.
3
 * function TreeNode(val, left, right) {
4
 *     this.val = (val===undefined ? 0 : val)
5
 *     this.left = (left===undefined ? null : left)
6
 *     this.right = (right===undefined ? null : right)
7
 * }
8
 */
9
/**
10
 * @param {TreeNode} root
11
 * @return {string[]}
12
 */
13
var binaryTreePaths = function (root) {
14
    if (!root) {
15
        return root;
16
    }
17
    let res = [];
18

19
    const getPath = (root, str) => {
20
        if (root) {
21
            if (str) {
22
                str += `->${root.val}`;
23
            } else {
24
                str = String(root.val);
25
            }
26
            if (root.left) {
27
                getPath(root.left, str)
28
            }
29
            if (root.right) {
30
                getPath(root.right, str)
31
            }
32
            if (!root.right && !root.left) {
33
                res.push(str);
34
            }
35
        }
36
    }
37

38
    getPath(root, '');
39

40
    return res;
41
};