扩展二叉树

扩展二叉树

一、心得

二、题目及分析

给定扩展二叉树的先序序列，求二叉树的中序和后序序列

输入
ABD..EF..G..C..
输出
dbfegac
dfgebca

三、代码及结果

//扩展二叉树 
#include <iostream>
#include <string>
using namespace std;

string s="ABD..EF..G..C..";
int m=-1;

typedef struct node{
    char data;
    node *lchild,*rchild;
}*tree; 


void creatTree(tree &bt){
    if(s[++m]!='.'&&m<s.length()){
        bt=new node;
        bt->data=s[m];
        cout<<bt->data<<" "<<m<<" ";
        creatTree(bt->lchild);
        creatTree(bt->rchild);         
    }
    else bt=NULL;

}
//先序遍历 
void printxx(tree bt){
    if(bt){
        cout<<bt->data<<" ";
        printxx(bt->lchild);
        printxx(bt->rchild);
    }
} 

//中序遍历 
void printzx(tree bt){
    if(bt){
        printzx(bt->lchild);
        cout<<bt->data<<" ";
        printzx(bt->rchild);
    }
} 

//后序遍历 
void printhx(tree bt){
    if(bt){
        printhx(bt->lchild); 
        printhx(bt->rchild);
        cout<<bt->data<<" ";
    }
} 

int main(){
    tree treeHead;
    creatTree(treeHead);
    cout<<endl;
    printxx(treeHead);
    cout<<endl;
    printzx(treeHead); 
    cout<<endl;
    printhx(treeHead);
    return 0;
}