<span style="font-size:18px;">template<typename Comparable >
bool binarSearchTree< Comparable >:: contain( const Comparable & x )const
{
return contain( x, root );
}
template<typename Comparable >
bool binarSearchTree<Comparable>:: contain(const Comparable & x ,binaryNode* t)const
{
if ( t == NULL)
return false;
else if ( x < t->element )
{
return contain( x, t->left);
}
else if (t->element< x)
{
return contain( x, t->right);
}
else
return true;
}</span>