Consider the following recursive definition of a function
search that performs search in a binary tree.
bool search(Type a, Tree T) {
if (empty(T)) {
return false;
}
else
if(a == data(T)) {
return true;
}
else {
bool bl = search(a, left(L));
bool br = search(a, right(L));
return bl || br;
}
}