dfs.js

// Recursive depth first search
function RecursiveDFSTraversal(root, fn, fnArgs) {
  if (!root) {
    return;
  }
  fnArgs = fn(root, fnArgs);
  for (var i = 0; fnArgs && i < root.children.length; i++) {
    RecursiveDFSTraversal(root.children[i], fn, fnArgs);
  }
}