二叉搜索树的搜索算法.cpp

#include<stdio.h>
typedef BiTree Position;

Position Find(BiTree root,ElemType data){
	if(!root){
	    return NULL;	
	}else if(root->data==data) {
	    return root;	
	}else if(data<root->data){/////Íü¼Ç´«²Îdata 
	    return Find(root->lchild,data);
	}else{
		return Find(root->rchild,data);//Íü¼Ç´«²Îdata 
	}	
}