Depth-first Search Javascript

dfs.js

const tree = {
  id: "1",
  children: [
    {id: "2", children: [
      {id: "4", children: [
        {id: "7", children: []}
      ]},    
      {id: "6", children: []},
    ]},
    {id: "3", children: [
      {id: "5", children: []},
    ]},
  ]
}

// takes in a tree and truncates to a max depth
const dfs = (node, id) => {
  if (node.id === id) return true
  for (let i = 0; i < node.children.length; i++) {
    let found = dfs(node.children[i], id)
    if (found) return true
  }
  return false
}

console.log(dfs(tree, "7")) // => true
console.log(dfs(tree, "5")) // => true
console.log(dfs(tree, "100")) // => false