code: public IntArrayList bfs(int root, boolean isRootT1) {
          boolean[] marked1 = new boolean[nodes1.size()];
          boolean[] marked2 = new boolean[nodes2.size()];
          return bfs(root, isRootT1, marked1, marked2);
      }
docs: Runs a breadth-first-search starting at the root node.