[求助]二叉树的C语言编程

志同道合 · 发表于 2005-10-30 01:27:49

<

>#include"stdio.h" #include"stdlib.h" typedef struct BiTNode{ char data; struct BiTNode *lchild; struct BiTNode *rchild; }BiTNode,BiTree; BiTree *root; int n=0; BiTree *creat() {BiTree *bt,*p,*s[30];int i,j,x; printf("i,x=");scanf("%d%d",&i,&x); while((i!=0)&&(x!=0)) {if((p=(BiTNode *)malloc(sizeof(BiTNode)))==NULL) return NULL; p->data=x;p->lchild=NULL;p->rchild=NULL; s=p; if(i==1) bt=p; else{j=i/2; if((i%2)==0) s[j]->lchild=p; else s[j]->rchild=p; } printf("i,x=");scanf("%d%d",&i,&x);} return (bt); } void inorder(BiTree *bt) {if(bt==NULL) return; inorder(bt->lchild); printf("%d\t",bt->data); inorder(bt->rchild); } void main() {printf("create a tree:"); root=creat(); printf("travel:"); inorder(BiTree *root); }
<>怎么老是有一个ERROR呢？

victor_kin · 发表于 2005-10-31 02:23:19

<

>兄弟，我用C++修改了你若干部分，仍保留你设计算法的初衷。No Error!
<

>#include <iostream> #include <cstdlib> using namespace std;
<

>struct BiTree { int data; struct BiTree *lchild; struct BiTree *rchild; };
BiTree *creat() { BiTree *bt = NULL,*p,*s[30]; int i,j,x; cout << "i, x = " ; cin >> i >> x; while(i != 0) { p = new BiTree; p->data = x;p->lchild = NULL;p->rchild = NULL; s = p; if(i==1) bt = p; else { j=i/2; if((i%2)==0) s[j]->lchild = p; else s[j]->rchild = p; } cout << "i, x = " ; cin >> i >> x; } return bt; }
void inorder(BiTree *bt) { if(bt==NULL) return; inorder(bt->lchild); cout << bt->data << '\t'; inorder(bt->rchild); }
void main() { BiTree *root; cout << "create a tree"; root=creat(); cout << "travel:" ; inorder(root); }

victor_kin · 发表于 2005-10-31 02:30:19

<

>C语言版的如下：
<

>#include"stdio.h" #include"stdlib.h"
<

>typedef struct BiTNode { int data; struct BiTNode *lchild; struct BiTNode *rchild; }BiTNode,BiTree;
BiTree *root; //int n=0;
BiTree *creat() { BiTree *bt,*p,*s[30]; int i,j,x; printf("i,x=");scanf("%d%d",&i,&x); while((i!=0)&&(x!=0)) { // if((p=(BiTNode *)malloc(sizeof(BiTNode)))==NULL) return NULL; p=(BiTNode *)malloc(sizeof(BiTNode)); p->data=x;p->lchild=NULL;p->rchild=NULL; s=p; if(i==1) bt=p; else { j=i/2; if((i%2)==0) s[j]->lchild=p; else s[j]->rchild=p; } printf("i,x=");scanf("%d%d",&i,&x); } return (bt); }
void inorder(BiTree *bt) { if(bt==NULL) return; inorder(bt->lchild); printf("%d\t",bt->data); inorder(bt->rchild); }
void main() { printf("create a tree:"); root=creat(); printf("travel:"); inorder(root); }

dace025927 · 发表于 2005-11-6 16:51:40

if(i==1) bt=p; else{j=i/2; if((i%2)==0) s[j]->lchild=p; else s[j]->rchild=p; } bt没赋值，又有可能没值，怎么返回？

		自动登录	找回密码
密码			注-册-帐-号

[求助]二叉树的C语言编程

bt可能值不确定，怎么返回