اجست و جو در درختbst

int BSTSearch ( node * T , int * x )
{
int founded = 0 ;
if ( T )
{
if ( T → data < x )
founded = BSTSearch ( T → Right , x ) ;
else if ( T → data > x )
founded = BSTSearch ( T → Left , x ) ;
else founded = 1 ;
}
return founded ;
}