二叉树前序遍历,java二叉树先序遍

头文件声明：

typedef struct BiTNode { TElemType data; struct BiTNode *lchild,*rchild;} BiTNode, *BiTree;

函数createPrBiTree(BiTree T,char definition)

//构造出前缀表达式二叉树char* createPrBiTree(BiTree *T,char* definition){ char ch = *definition; *T = (BiTree)malloc(sizeof(BiTNode)); (*T)->data = ch; if ('0' <= ch && ch <= '9') { //不构造子树 (*T)->lchild = NULL; (*T)->rchild = NULL; } else { //构造子树,并记录字符位置 definition = createPrBiTree(&((*T)->lchild),definition+1); definition = createPrBiTree(&((*T)->rchild),definition+1); } return definition;}