Iterative Deepening DFS — DFS Space + BFS Optimality

boolean iddfs(Node root, Node target) {
  for (int depth = 0; depth < MAX; depth++) {
    if (dls(root, target, depth)) return true;
  }
  return false;
}
boolean dls(Node n, Node target, int limit) {
  if (n == target) return true;
  if (limit == 0) return false;
  for (Node child : children(n))
    if (dls(child, target, limit - 1)) return true;
  return false;
}