二叉树的遍历 插入 查找 删除 最大值 最小值 前驱 后继节点的查找

#include <iostream>
#include<queue>
using namespace std;
//binery search-tree ADT
struct treeNode
{
	int value;
	treeNode* left;
	treeNode*right;
	treeNode*parent;
};
//fun1  二叉树的插入即建立
treeNode * treeInsert(treeNode* head,int n)
{  
    treeNode* newNode=new treeNode;
	newNode->left=newNode->right=NULL;
	newNode->parent=NULL;
	newNode->value=n;
	if (head==NULL)
	{  
	      newNode->parent=NULL;
		  return newNode;
	}
	
    treeNode *head1=head,*head2=NULL;
      	while (head1!=NULL)//先确定待插入的父亲节点 
      	     {   
      	       head2=head1;
      	     	if(head1->value>n)
      	     	    head1=head1->left;
      	     	else
      	     	   head1=head1->right;
      	     	
      	     }
      	     newNode->parent=head2;
      	     if(head2->value>n)
                {
                	head2->left=newNode;
                	
                }