用链表的形式动态的去创建一个二叉树
定义一个结构体
struct brtree{
struct btree *left;
int data ;
struct btree *right;
};
typedf struct btree bttreenode
typedf treenode *pbttree;
//插入一个节点列出二叉树
pbttree insert_listbtree(pbttree root,int date )
{
pbttree pnewnode;//新创建节点
newnode =()malloc(size of (treenode));
pnewnode->date=date;
pnewnode->left=null;
pnewnode->right=null;
if(root=Null)//空二叉树
{
return pnewnode;
}
else{
Current node=root;
while(Current node!= Null)
{
parent node=Current node;
if(Current node->date>date){
Currentnode=Currentnode->left;
}else{
Currentnode=Currentnode->right;
}
}
//找到位置
if (Par