多叉树(孩子兄弟).zip，（多叉树的创建和打印）

#include<stdio.h> #include<stdlib.h> #include<iostream> using namespace std; typedef struct CSNode{ char data; struct CSNode*Firstch; struct CSNode*Nextbro; }CsNode,*CsTree; CsNode*CreatTree(CsNode*T){ char ch; scanf(" %c",&ch); if(ch=='#'){ T=NULL; return NULL; }else{ T=(CsNode*)malloc(sizeof(CsNode)); T->data=ch; T->Firstch=CreatTree(T->Firstch); T->Nextbro=CreatTree(T->Nextbro); } return T; } //先序遍历算法 void PreCreat(CsNode*T) { if(T==NULL) return ; cout<<T->data<<" "; PreCreat(T->Firstch); PreCreat(T->Nextbro); } //凹入表形式打印 void Oprint(CsNode*T,string s) { if(T==NULL) return ; cout<<s<<T->data<<endl; Oprint(T->Firstch,s+" "); Oprint(T->Nextbro,s); } int main(){ cout<<"先序遍历创建多叉树,#为空\n"; CsNode*T=CreatTree(T); //PreCreat(T); //cout<<endl; string s=""; Oprint(T,s); //abe#f##cg##d#### }