05---二叉树---20195106006---陈辉.c

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163

#include<stdio.h> #include<malloc.h> #include<process.h> #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define MAX_TREE_SIZE 100 typedef int Status; typedef int TElemType; TElemType Nil = 0; typedef TElemType SqBiTree[MAX_TREE_SIZE]; Status visit(TElemType e) {     printf("%d ", e);     return OK; } Status InitBiTree(SqBiTree T) {     int i;     for (i = 0; i < MAX_TREE_SIZE; i++)         T[i] = Nil;     return OK; } Status CreateBiTree(SqBiTree T) {     int i = 0;     printf("\n\n\t\t\t\t\t按层创建二叉树\n\t\t\t\t\t");     printf("请按层序输入结点的值(整型)\n\n\t0表示空结点,空格隔开，输999结束。结点数≤%d:\n", MAX_TREE_SIZE);     while (1)     {         scanf_s("%d", &T[i]);         if (T[i] == 999)             break;         if (i != 0 && T[(i + 1) / 2 - 1] == Nil && T[i] != Nil)         {             printf("出现无双亲的非根结点%d\n", T[i]);             exit(ERROR);         }         i++;     }     while (i < MAX_TREE_SIZE)     {         T[i] = Nil;         i++;     }     return OK; } Status BiTreeEmpty(SqBiTree T) {     if (T[0] == Nil)         return TRUE;     else         return FALSE; } int BiTreeDepth(SqBiTree T) {     int i, j = -1;     for (i = MAX_TREE_SIZE - 1; i >= 0; i--)         if (T[i] != Nil)             break;     i++;     do         j++;     while (i >= pow(2, j));     return j; } Status Root(SqBiTree T, TElemType *e) {       if (BiTreeEmpty(T))         return ERROR;     else     {         *e = T[0];         return OK;     } } Status(*VisitFunc)(TElemType); void PreTraverse(SqBiTree T, int e) {     VisitFunc(T[e]);     if (T[2 * e + 1] != Nil)         PreTraverse(T, 2 * e + 1);     if (T[2 * e + 2] != Nil)         PreTraverse(T, 2 * e + 2); } Status PreOrderTraverse(SqBiTree T, Status(*Visit)(TElemType)) {     VisitFunc = Visit;     if (!BiTreeEmpty(T))         PreTraverse(T, 0);     printf("\n");     return OK; } void InTraverse(SqBiTree T, int e) {     if (T[2 * e + 1] != Nil)         InTraverse(T, 2 * e + 1);     VisitFunc(T[e]);     if (T[2 * e + 2] != Nil)         InTraverse(T, 2 * e + 2); } Status InOrderTraverse(SqBiTree T, Status(*Visit)(TElemType)) {     VisitFunc = Visit;     if (!BiTreeEmpty(T))         InTraverse(T, 0);     printf("\n");     return OK; } void PostTraverse(SqBiTree T, int e) {     if (T[2 * e + 1] != Nil)         PostTraverse(T, 2 * e + 1);     if (T[2 * e + 2] != Nil)         PostTraverse(T, 2 * e + 2);     VisitFunc(T[e]); } Status PostOrderTraverse(SqBiTree T, Status(*Visit)(TElemType)) {     VisitFunc = Visit;     if (!BiTreeEmpty(T))         PostTraverse(T, 0);     printf("\n");     return OK; } void LevelOrderTraverse(SqBiTree T, Status(*Visit)(TElemType)) {     int i = MAX_TREE_SIZE - 1, j;     while (T[i] == Nil)         i--;     for (j = 0; j <= i; j++)         if (T[j] != Nil)             Visit(T[j]);     printf("\n"); } void main() {     Status i;     TElemType e;     SqBiTree T, s;     printf("\n");     printf("--------------------------------");     printf("   电科一班陈辉作品   ");     printf("----------------------------------\n");     InitBiTree(T);     CreateBiTree(T);     printf(" \n树的深度=%d\n",BiTreeDepth(T));     i = Root(T, &e);     if (i)         printf("\n二叉树的根为：%d\n", e);     else         printf("树空，无根\n");     printf("\n先序遍历二叉树:\n");     PreOrderTraverse(T, visit);     printf("\n中序遍历二叉树:\n");     InOrderTraverse(T, visit);     printf("\n后序遍历二叉树:\n");     PostOrderTraverse(T, visit);     printf("\n层序遍历二叉树:\n");     LevelOrderTraverse(T, visit); }