二叉树的节点删除

//--------删除-----------
int treeDeleteData(Pnode *proot,int data){
	if(proot == NULL){
		return 1;
	}
	Pnode pFind = *proot;
	Pnode pFather = NULL;
	Pnode pDelete = NULL;
	//01找到数据为data的节点的地址以及父节点的地址
	while(pFind != NULL){
	
		if(data == pFind->data){
			break;
		}else if(data < pFind->data){
			
			pFather = pFind;
			pFind = pFind->left;
		}else{
			pFather = pFind;
			pFind = pFind->right;
		}
	}
	//02 没找到
	if(pFind == NULL){
		return 1;
	}
	//03 已经找到
	//03-1 没有左子树，删除的就是pFind那个节点
	if(pFind->left == NULL){
		//根节点 
		if(pFather == NULL){//数据点在------根节点
			*proot = pFind->right;
		}else{
			if(pFather->left == pFind){//该数据点在父节点的左面
				pFather->left = pFind->right;
			}else{
				pFather->right = pFind->right;
			}
		}
		free(pFind);
		return 0;	
	}


	//03-2左子树右边没有节点，则删除pFind->left对应的节点
	if(pFind->left->right == NULL){


		pDelete = pFind->left;
		pFind->data = pDelete->data;
		pFind->left = pDelete->left;
		free(pDelete);


		return 0;
	}


	//03-3 左子树右边最少有一个节点 ,往右边一直找找到最右节点，删除
	pFather = pFind->left;
	pDelete = pFather->right;


	while(pDelete->right != NULL){
		pFather = pDelete;
		pDelete = pDelete->right;
	}
	pFather->right = pDelete->left;
	pFind->data = pDelete->data;
	free(pDelete);


	return 0;
}