AVL的查找操作

void search(node* root,int x){
	if(root==NULL){
		printf("search failde");//空树，查找失败
		return;
	}
	if(x==root->v){//查找成功，访问之
		printf("%d\n",root->v);
	}else if(x<root->v){
		search(root->lchild,x);
	}else{
		search(root->rchild,x);
	}
}