842. Time Complexity: Tree DFS

function sumTree(root) {
  if (!root) return 0
  return root.value + sumTree(root.left) + sumTree(root.right)
}