someReturnType findItemBinTree(int item, node * root) {
    if (root != NULL) {
        if (root->data == item)
            return whatever;
        else {
            findItemBinTree(item, root->lf);
            findItemBinTree(item, root->rt);
        }
    }
}