Write a recursive search function for finding an element in a binary search tree. You

should use the notion of a left or right subtree of a node in your definition. $($In

Definition $3\mathrm{.}8,$ the left and right subtrees are T$1$ and T$2$

$,$ respectively.$)$ Make sure you

account for empty nodes