#include <stdio.h>#include <stdlib.h>typedef char ElemType;typedef struct BiTNode{ char data; struct BiTNode *lchild; struct BiTNode *rchild; int DescNum;}BiTNode ,*BiTree;void CreateBiTree(BiTree *T) { char ch; scanf("%c",&ch); if(ch==' '){ *T=NULL; } else { *T=(BiTNode*)malloc(sizeof(BiTNode*)); (*T)->data=ch; CreateBiTree(&(*T)->lchild) ; CreateBiTree(&(*T)->rchild) ; }}void visit(char c){ printf("%c",c);}int PreOrderTraverse(BiTree T,int count){ int p; if(T) { p=count; visit(T->data); count=PreOrderTraverse(T->lchild,count); count=count+PreOrderTraverse(T->rchild,p); T->DescNum=count; count=count+1; return count; }} void ReadD(BiTree T){ if(T) { printf("%d",T->DescNum); ReadD(T->lchild); ReadD(T->rchild); }} int main(){ BiTree T; int count=0; printf("请按先序遍历输入二叉树:"); CreateBiTree(&T); printf("先序遍历:\n"); PreOrderTraverse(T,count); printf("\n按先序遍历读取DescNum:\n"); ReadD(T); return 0;}