树状输出二叉树
发布网友
共1个回答
热心网友
#include<iostream.h> #include<malloc.h> #include<stdio.h> struct BinTreeNode; typedef struct BinTreeNode * PBinTreeNode; struct BinTreeNode { char info; PBinTreeNode llink; PBinTreeNode rlink; }; PBinTreeNode createEmptyBinTree_link() { PBinTreeNode p; char x; cin>>x; if(x==' '||x=='z' ) { p=NULL; return NULL; } else { p=(PBinTreeNode)malloc(sizeof(BinTreeNode)); if(p==NULL) return NULL; else { p->info=x; p->llink=createEmptyBinTree_link(); p->rlink=createEmptyBinTree_link(); } } return(p); } void preOrder(PBinTreeNode p) { char x; if(p==NULL) return ; x=p->info; cout<<x; preOrder(p->llink); preOrder(p->rlink); } void main() { PBinTreeNode p; p=createEmptyBinTree_link(); preOrder(p); }
热心网友
#include<iostream.h> #include<malloc.h> #include<stdio.h> struct BinTreeNode; typedef struct BinTreeNode * PBinTreeNode; struct BinTreeNode { char info; PBinTreeNode llink; PBinTreeNode rlink; }; PBinTreeNode createEmptyBinTree_link() { PBinTreeNode p; char x; cin>>x; if(x==' '||x=='z' ) { p=NULL; return NULL; } else { p=(PBinTreeNode)malloc(sizeof(BinTreeNode)); if(p==NULL) return NULL; else { p->info=x; p->llink=createEmptyBinTree_link(); p->rlink=createEmptyBinTree_link(); } } return(p); } void preOrder(PBinTreeNode p) { char x; if(p==NULL) return ; x=p->info; cout<<x; preOrder(p->llink); preOrder(p->rlink); } void main() { PBinTreeNode p; p=createEmptyBinTree_link(); preOrder(p); }
