Question 5.5 from the course text.
bool search ( Node *rt, int K ) { if (rt == NULL) return FALSE; if (rt->aKey == K) return TRUE; return (search (Node->left, K) | search (Node->right, K)); }