void seek_and_print (const Tree tree, const int k1, const int k2) { if (tree != NULL) { if (tree -> item >= k1) seek_and_print (tree -> left, k1, k2) ; if (tree -> item >= k1 && tree -> item <= k2) printf ("%d", tree -> item) ; if (tree -> item <= k2) seek_and_print (tree -> right, k1, k2) ; } }