妙不可言的算法之二叉樹的建立與遍歷

#include <stdio.h> #include <stdlib.h> #include <malloc.h> typedef int ElemType; typedef struct node { ElemType data; struct node *lchild; struct node *rchild; }BitNode,*BitTree; void CreateTr

>>阅读原文<<