static GazelleTree gazelle_searchTree_breadthFirst_backwards(F1<GazelleTree, Bool> pred, L<GazelleTree> nodes) {
  new LinkedList<GazelleTree> queue;
  addAllReversed(queue, nodes);
  while (nempty(queue)) {
    GazelleTree t = popFirst(queue);
    if (checkCondition(pred, t)) ret t;
    if (t.isSplitNode)
      addAllReversed(queue, t.children);
    else
      addAll(queue, t.children);
  }
  null;
}