#include<stdio.h>
#include<stdlib.h>
typedef struct BiNode
{
char data;
struct BiNode *lchild , *rchild;
}BiTree; //节点(数据,左孩子,右孩子 )
BiTree *create(BiTree *T) //创建二叉链表(递归算法)
{
char ch;
if((ch = getchar()) == '#') //按照前序遍历输入,缺少孩子用‘#’补齐
return NULL;
else
{
T = (BiTree*)malloc(sizeof(BiTree));
T->data = ch;
#include<stdlib.h>
typedef struct BiNode
{
char data;
struct BiNode *lchild , *rchild;
}BiTree; //节点(数据,左孩子,右孩子 )
BiTree *create(BiTree *T) //创建二叉链表(递归算法)
{
char ch;
if((ch = getchar()) == '#') //按照前序遍历输入,缺少孩子用‘#’补齐
return NULL;
else
{
T = (BiTree*)malloc(sizeof(BiTree));
T->data = ch;