《孩子表示法判断深度》由会员分享，可在线阅读，更多相关《孩子表示法判断深度（2页珍藏版）》请在金锄头文库上搜索。
1、孩子表示法-深度#include #include #include #define MAX_TREE_SIZE 100typedef struct CTNode int child;struct CTNode *next; CTNode, *ChildPtr; / 孩子链表结点typedef struct char data;ChildPtr firstChild; CTBox;typedef struct CTBox nodesMAX_TREE_SIZE;intn;/树的结点的数量int r;/数的根结点的位置 CTree;int createCTree(CTree &T) /创建用孩子表
2、示法表示的树int x, i = 0;char c;ChildPtr p;printf(-请输入树的每个结点，以回车结束：)；c = getchar();while(c != n) T.nodesi.data = c; T.nodesi.firstChild = NULL; i+; c = getchar();T.n = i;printf(请输入根结点的位置：”)；scanf(%d”, &(T.r); getchar();i = 0;while(i = 0) p = (ChildPtr)malloc(sizeof(CTNode); p-child = x;p-next = T.nodesi.f
3、irstChild; T.nodesi.firstChild = p;scanf(%d”, &x);getchar(); i+;return 1;int depthCTree(CTree T, int n) /以第n个结点为根的子树深度int max = 0; /当前树T的子树的深度最大值 int h;ChildPtr p = T.nodesn.firstChild;while(p) h = depthCTree(T, p-child);if(h max) max = h;p = p-next;return max + 1;int main() CTree T;createCTree(T);printf(该树的深度为：%dn, depthCTree(T, T.r);return 1;
