[交流] 二叉树的动态创建 已有4人参与

#include <stdio.h> #include <stdlib.h> #include <malloc.h> typedef struct node { char data; struct node *lchild, *rchild; }bnode,*btree; void createbtree(btree &t,int &n) { char x; btree q; n=n+1; printf("\nInput  %d  DATA:",n); x=getchar(); if(x!='\n')getchar(); if (x=='\n')return  ; q=(btree)malloc(sizeof(bnode)); q->data=x; q->lchild=NULL; q->rchild=NULL; t=q; printf(" This Address is: %o, Data is:  %c,\n  Left Pointer is: %o,  Right Pointer is:  %o",q,q->data,q->lchild,q->rchild); createbtree(q->lchild,n); createbtree(q->rchild,n); return  ; } void visit(btree e) { printf("  Address: %o,  Data:  %c,  Left Pointer: %o,  Right Pointer:  %o\n",e,e->data,e->lchild,e->rchild); } void pretraverse(btree t) { if(t) {   visit(t);   pretraverse(t->lchild);   pretraverse(t->rchild); } else return ; } void countleaf(btree t,int &c) {         if(t!=NULL)   {           if (t->lchild==NULL && t->rchild==NULL)           {c=c+1;           }    countleaf(t->lchild,c);    countleaf(t->rchild,c);   } } int treehigh(btree t) {   int lh,rh,h; if(t==NULL)   h=0; else {   lh=treehigh(t->lchild);   rh=treehigh(t->rchild);   h=(lh>rh? lh:rh)+1; } return h; } int main() { btree t; int count=0,n=0; printf("\n Please input TREE Data:\n"; createbtree(t,n); printf("\n  This is TREE Struct: \n"; pretraverse(t); countleaf(t,count); printf("\n This TREE has %d leaves,  High of The TREE is: %d\n",count,treehigh(t)); return 0; } Sample Text有没有谁能看出输入语句是如何结束的？ 动态创建二叉树的思路是什么？ [ Last edited by 邦桀南瑜 on 2013-11-15 at 20:08 ]

回复此楼