二叉树已知中序后序求前序

最新推荐文章于 2022-06-22 11:34:23 发布

田益铭

最新推荐文章于 2022-06-22 11:34:23 发布

阅读量1.7k

点赞数 2

分类专栏：程序设计文章标签：数据结构序列遍历链表

本文链接：https://blog.csdn.net/u012860063/article/details/46801049

版权

程序设计专栏收录该内容

14 篇文章 0 订阅

订阅专栏

题意：

给出一棵二叉树的中序和后序遍历，求它的前序遍历。

代码如下：

#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <iostream>
#include <cstdlib>
using namespace std;
struct TNode
{
    char cInfo;
    TNode * pLeft;
    TNode * pRight;
};
#define NULL 0
#define LEN sizeof(TNode)
typedef TNode * pBTNode;
void vCreatTree(string sMidOrd,string sPostOrd,pBTNode pRoot)
{
    int nLen,nPos;
    char cData;
    string sMidOrd1,sMidOrd2,sPostOrd1,sPostOrd2;
    pBTNode pLSon,pRSon;
    nLen=sPostOrd.size();
    cData=sPostOrd[nLen-1];
    pRoot->cInfo=cData;
    pRoot->pLeft=NULL;
    pRoot->pRight=NULL;
    nPos=sMidOrd.find(cData);
    if(nLen>1)
    {
        if(nPos>0)
        {
            sMidOrd1=sMidOrd.substr(0,nPos);
            sPostOrd1=sPostOrd.substr(0,nPos);
            pLSon=(struct TNode *)malloc(LEN);
            pRoot->pLeft=pLSon;
            vCreatTree(sMidOrd1,sPostOrd1,pLSon);
        }
        if(nLen-1>nPos)
        {
            sMidOrd2=sMidOrd.substr(nPos+1,nLen-nPos-1);
            sPostOrd2=sPostOrd.substr(nPos,nLen-nPos-1);
            pRSon=(struct TNode *)malloc(LEN);
            pRoot->pRight=pRSon;
            vCreatTree(sMidOrd2,sPostOrd2,pRSon);
        }
    }
}
//获得前序遍历
string sGetPreOrd(pBTNode pRoot)
{
    string sRet;
    sRet="";
    if(pRoot!=NULL)
    {
        sRet+=pRoot->cInfo;
        sRet+=sGetPreOrd(pRoot->pLeft);
        sRet+=sGetPreOrd(pRoot->pRight);
    }
    return sRet;
}
// 删除树
void vDeleteTree(pBTNode pRoot)
{
    if(pRoot->pLeft!=NULL)
    {
        vDeleteTree(pRoot->pLeft);
        free(pRoot->pLeft);
        pRoot->pLeft=NULL;
    }
    if(pRoot->pRight!=NULL)
    {
        vDeleteTree(pRoot->pRight);
        free(pRoot->pRight);
        pRoot->pRight=NULL;
    }
}
//输出
void vOutput(string sOut)
{
    cout << sOut << endl;
}
int main()
{
    string sMidOrd,sPostOrd,sPreOrd;
    pBTNode pRoot;
    while(cin >> sMidOrd >> sPostOrd)
    {
        pRoot=(struct TNode *)malloc(LEN);
        vCreatTree(sMidOrd,sPostOrd,pRoot);
        sPreOrd=sGetPreOrd(pRoot);
        vOutput(sPreOrd);
        //vDeleteTree(pRoot);
        free(pRoot);
    }
    return 0;
}
/*
DCFEAB
DFECBA
*/