题目：二叉树的创建及遍历
实验序号：5
#include <stdio.h>
#include <malloc.h>
#include <conio.h>
#define MaxSize 100
typedef char ElemType;typedef struct node
{
ElemType data; //数据元素
struct node *lchild; //指向左孩子
struct node *rchild; //指向右孩子
} BTNode;/*
以下代码为二叉树基本运算，部分函数在实验指导书上
*/void main()
{
char cc[]={"A(B(D(,G)),C(E,F))"};
BTNode *b;
CreateBTNode(b,cc); //CreateBTNode函数用于根据括号表示法构建二叉链表，此函数
}............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................../*
