创建二叉树

typedef struct Node
{
	int num;
	struct Node *left;
	struct Node *right;
}node,*link;
link newnode,tempnode;
link rootnode;

void charu(int value)
{
	int flag=0;//标识新数据是否已经插入到二叉树当中
	newnode=new node;
	newnode->num =value;
	newnode->left =NULL;
	newnode->right =NULL;
	if(rootnode==NULL)
		tempnode=newnode;
	while(flag==0)
	{
		if(newnode->num<tempnode->num )
		{
			if(tempnode->left ==NULL)
			{
				tempnode->left =newnode;
				flag=1;
			}
			else
				tempnode=tempnode->left ;
		}
		else 
		{ 
			if(newnode->num >tempnode->num )
			{
				if(tempnode->right==NULL)
				{
					tempnode->right =newnode;
					flag=1;
				}
				else
					tempnode=tempnode->right ;

			} 
		}
	}
}

int main()
{
	int value;
	for(int i=0;i<6;i++)
	{
		cin>>value;
		charu(value);
	}
	system("pause");
	return 0;
}