smaller
smaller(tree, s->heap[j + 1], s->heap[j], s->depth)) {
if (smaller(tree, v, s->heap[j], s->depth)) break;
smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
if (smaller(tree, v, s->heap[j], s->depth)) break;