一、二叉树的建立
1、建立结构体
typedef char ElemType;
typedef struct BtNode //结构体
{
BtNode *leftchild;
BtNode *rightchild;
ElemType data;
}BtNode, *BinaryTree;
2、购买结点
BtNode * Buynode()
{
BtNode s = (BtNode)malloc(sizeof(BtNode));
if(s == NULL) exit(1);
memset(s,0,sizeof(BtNode));//清零
return s;
}
3、建立二叉树
通过递归调用实现
BtNode * CreateTree()
{
BtNode *s = NULL;
ElemType item;
scanf(“%c”,&item);
if(item != ‘#’)
{
s = Buynode();
s->data = item;
s->leftchild = CreateTree();
s->rightchild = CreateTree();
}
return s;
}
4、前、中、后遍历的实现
①前序遍历
void PreOrder(BtNode *ptr)
{
if(ptr != NULL)
{
printf(“%c “,ptr->data);
PreOrder(ptr->leftchild);
PreOrder(p