Binary Tree Paths LeetCode solution in JavaScript

1
var binaryTreePaths = function (root) {
2
  if (root === null) {
3
    return [];
4
  }
5
  const lPath = binaryTreePaths(root.left);
6
  const rPath = binaryTreePaths(root.right);
7
  if (lPath.length === 0 && rPath.length === 0) return ["" + root.val];
8

9
  if (lPath.length > 0)
10
    for (let i = 0; i < lPath.length; i++)
11
      lPath[i] = root.val + "->" + lPath[i];
12
  if (rPath.length > 0)
13
    for (let i = 0; i < rPath.length; i++)
14
      rPath[i] = root.val + "->" + rPath[i];
15
  return lPath.concat(rPath);
16
};