关于树的各种C语言代码.doc

集合了树的各种算法，已经运行过，本人亲自所写，先序，后序，等全包括 #includestdio.h #includemalloc.h #define Max 100 typedef int Status; typedef struct BiTNode { char data; struct BiTNode *lchild,*rchild; }BiTNode,*BiTree; int count; Status CreatBiTree(BiTree *bt) /*1.按先序遍历序列创造二叉树的二叉链表*/ { char ch; getchar(); scanf(%c,ch); if (ch == ) { *bt = NULL; } else { *bt = (BiTree)malloc(sizeof(BiTNode)); (*bt)-data = ch; printf(\n\t请输入%c结点的左孩子:,(*bt)-data); CreatBiTree(((*bt)-lchild)); printf(\n\t请输入%c结点的右孩子:,(*bt)-data); CreatBiTree(((*bt)-rchild)); } return 1; } void PreOrder(BiTree bt) /*2.先序遍历二叉树*/ { if (bt != NULL) { printf(%c\n,bt-data); PreOrder(bt-lchild); PreOrder(bt-rchild); } } void InOrder(BiTree bt) /*3.中序遍历二叉树*/ { if (bt != NULL) { InOrder(bt-lchild); printf(%c\n,bt-data); InOrder(bt-rchild); } } void PostOrder(BiTree bt) /*4.后序遍历二叉树*/ { if (bt != NULL) { PostOrder(bt-lchild); PostOrder(bt-rchild); printf(%c\n,bt-data); } } void PreOrderLeaf(BiTree bt) /*5.输出所有的叶子结点*/ { if (bt != NULL) { if ((bt-lchild == NULL) (bt-rchild == NULL)) { printf(%c\n,bt-data); } PreOrderLeaf(bt-lchild); PreOrderLeaf(bt-rchild); } } Status Leaf(BiTree bt) /*6.统计叶子结点数目，即度为零的结点数目*/ { if (bt == NULL) { count = 0; } else if ((bt-lchild == NULL) (bt-rchild == NULL)) { count = 1; } else { count = Leaf(bt-lchild) + Leaf(bt-rchild); } return count; } void Degree1Node(BiTree bt) /*7.输出度为一的结点*/ { if (bt != NULL) { if (((bt-lchild != NULL) || (bt-rchild != NULL)) (!((bt-lchild != NULL) (bt-rchild != NULL)))) { printf(%c\n,bt-data); } Degree1Node(bt-lchild); Degree1Node(bt-rchild); } } void Degree2Node(BiTree bt) /*8.输出度为二的结点*/ { if ( bt != NULL) { if ((bt-lchild != NULL) (bt-rchild != NULL)) { printf(%c\n,bt-data); } Degree2Node(bt-lchild); Degree2Node(bt-rchild); } } Status CountNode(BiTree bt) /*9.统计二叉树中结点的总数*/ { if (bt == NULL) { return 0; } else { count++; CountNode(bt-