摘要： 今天看了点数据结构二叉树方面的东西。#include <iostream>#include<stdio.h>#include<stdlib.h>using namespace std;typedef struct BiTNode{ char data; struct BiTNode *lchild, *rchild;}BiTNode,*BiTree;void CreateBiTree(BiTree *T){ char c; cin.get(c); if(c == ' ') *T = NULL; else{ *T = (BiTNode *)ma 阅读全文