InsertL(bt,x,parent) |
BiTree InsertL(BiTree bt,elemtype x,BiTree parent) |
{ |
/*在二叉树bt 的结点parent 的左子树插入结点数据元素x*/ |
BiTree p; |
if ( parent==NULL ) |
{ |
printf ( “\n 插入出错” ) ; |
return NULL; |
} |
if ( ( p= ( BiTNode * ) malloc ( sizeof ( BiTNode ) ) ) ==NULL ) return NULL; |
p->data=x; |
p->lchild=NULL; |
p->rchild=NULL; |
if ( parent->lchild==NULL ) parent->lchild=p; |
else |
{ |
p->lchild=parent->lchild; |
parent->lchild=p; |
} |
return bt; |
} |