find_deep

find_deep

template <typename Value>
int BStree<Value>::
deep(node<Value> *root,Value target){
	if(root->value==target) {
		return 1;
	}
        else {
	        if(root->left!=0) {
		       return (1+deep(root->left,target));
	        }
	        if(root->right!=0) {
		       return (1+deep(root->right,target));
	        }
        }
}