5
      /   \
     3     8
    / \   / \
   1   4 7   9

5 -> 3 -> 1  為 531
5 -> 3 -> 4  為 534
5 -> 8 -> 7  為 587
5 -> 8 -> 9  為 589

class TreeNode {
  constructor(value) {
    this.value = value;
    this.left = null;
    this.right = null;
  }
}

function sumPaths(node, currentSum = 0) {
  if (!node) return 0;

  currentSum = currentSum * 10 + node.value;

  // 如果是葉子節(jié)點，直接返回當前和
  if (!node.left && !node.right) return currentSum;

  // 否則返回左右子樹的和
  return sumPaths(node.left, currentSum) + sumPaths(node.right, currentSum);
}

// 使用上面的樹作為示例
const root = new TreeNode(5);
root.left = new TreeNode(3);
root.right = new TreeNode(8);
root.left.left = new TreeNode(1);
root.left.right = new TreeNode(4);
root.right.left = new TreeNode(7);
root.right.right = new TreeNode(9);

console.log(sumPaths(root)); // 輸出: 2241

function dfs(node) {
  if (node == null) return;

  console.log(node.value);  // 處理當前節(jié)點
  dfs(node.left);  // 遞歸訪問左子節(jié)點
  dfs(node.right);  // 遞歸訪問右子節(jié)點
}

function dfs(graph, start) {
  let stack = [];
  let visited = new Set();

  stack.push(start);

  while (stack.length) {
    let node = stack.pop();
    if (!visited.has(node)) {
      console.log(node);  // 處理當前節(jié)點
      visited.add(node);

      // 添加未訪問的鄰接節(jié)點到堆棧
      for (let neighbor of graph[node]) {
        if (!visited.has(neighbor)) {
          stack.push(neighbor);
        }
      }
    }
  }
}