二叉树插入数据操作
struct node *insert_node(struct node *new,struct node *root)
{
if(root==NULL)
{
return new;
}
if(new->data > root->data)
{
root->rchild = insert_node(new,root->rchild);
}
else if(new->data < root->data)
{
root->lchild = insert_node(new,root->lchild);
}
else
{
printf("%d node already exit!\n",new->data);
}
}
int main(int argc,char*argv[])
{
// 初始化根节点
struct node *root = NULL;
root = init_new_node(20);
//插入节点到二叉树中
struct node *new = NULL;
new = init_new_node(10);
insert_node(new,root);
new = init_new_node(10);
insert_node(new,root);
new = init_new_node(15);
insert_node(new,root);
new = init_new_node(12);
insert_node(new,root);
}