simple bfs/dfs comparison

bfs-dfs.js

const search = nextNode => (root, visit) => {
  let list = [root]
  while (list.length) {
    const node = nextNode(list)
    visit(node)
    list = list.concat(node.children)
  }
}

const bfs = search(list => list.shift())
const dfs = search(list => list.pop())

const tree = {
  data: 's',
  children: [
    { data: 1,
      children: [
        { data: 3, children: [] },
        { data: 4, children: [] },
      ],
    },
    { data: 2,
      children: [
        { data: 5, children: [] },
      ],
    },
  ],
}

const visit = (node) => console.log(node.data)
bfs(tree, visit)
dfs(tree, visit)