重构二叉树

最新推荐文章于 2020-07-06 23:36:55 发布

几番风雨

最新推荐文章于 2020-07-06 23:36:55 发布

阅读量263

点赞数

分类专栏： C++ 文章标签：二叉树

本文链接：https://blog.csdn.net/Oyj1020/article/details/77924291

版权

C++ 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

重构二叉树算法流程

这里写图片描述

表格分析

这里写图片描述

算法代码

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

struct TreeNode* ReconstruBTree(vector<int> preTree, vector<int> midTree)
{
    if (preTree.size() == 0 || midTree.size() == 0){
        return nullptr;
    }
    int leftcnt =0,rightcnt= 0,rootIndex=0;
    int rootValue = preTree[0];
    int treecnt = preTree.size();
    bool bFindRoot = false;
    for (int i = 0; i < midTree.size();i++)
    {       
        if (rootValue == midTree[i])
        {           
            bFindRoot = true;
            rootIndex = i;
            break;
        }
        leftcnt++;
    }   
    if (!bFindRoot){ return nullptr;}
    rightcnt = treecnt - leftcnt - 1;

    vector<int>preleftTree;
    vector<int>prerightTree;

    vector<int>midleftTree;
    vector<int>midrightTree;
    for (int i = 0; i < midTree.size(); i++)
    {
        if (i<rootIndex)
        {
            midleftTree.push_back(midTree[i]);
        }
        else if (i>rootIndex){
            midrightTree.push_back(midTree[i]);
        }
    }

    for (int i = 0; i < preTree.size(); i++)
    {
        if (i>0 && i <= leftcnt)
        {
            preleftTree.push_back(preTree[i]);
        }
        else if (i > leftcnt)
        {
            prerightTree.push_back(preTree[i]);
        }
    }

    TreeNode* rootTree = new TreeNode(rootValue);
    TreeNode* lNode = ReconstruBTree(preleftTree, midleftTree);
    TreeNode* rNode = ReconstruBTree(prerightTree, midrightTree);
    rootTree->left = lNode; 
    rootTree->right = rNode;
    return rootTree;    
}