qq_64096402的博客

原创 数据结构(c语言版)

二叉树的前中后序遍历#include<stdio.h>#include<stdlib.h>#define MAXSIZE 200typedef int TElemType;typedef struct BiTNode{ TElemType data; struct BiTNode *lchild,*rchild;}BiTNode,*BiTree;void createBiTree(BiTree *t){ //先序遍历创建二叉树 in