重建二叉树（已知前序遍历和中序遍历序列求二叉树）

#include <iostream>
#include<exception>
#include<stdlib.h>
#include <stdexcept>
using namespace std;
struct BinaryTreeNode{ //定义二叉树的节点
int m_nValue;
BinaryTreeNode* m_pLeft;
BinaryTreeNode* m_pRight;
};

BinaryTreeNode* ConstructCore(int* startPreorder,int* endPreorder,int* startInorder,int* endInorder){
//前序遍历第一个数字为根节点的值
int rootValue = startPreorder[0];
BinaryTreeNode* root = new BinaryTreeNode();
root->m_nValue=rootValue;
root->m_pLeft=root->m_pRight=nullptr;
if(startPreorder==endPreorder){
if(startInorder==endInorder&&*startInorder==*startPreorder){
return root;
}
else{
std::logic_error ex("Invalid input");
throw exception(ex);
}
}
//在中序遍历中找到根节点的值
int* rootInorder = startInorder;
while(rootInorder<=endInorder&&*rootInorder!=rootValue){
++rootInorder;
}
if(rootInorder==endInorder&&*rootInorder!=rootValue){
logic_error ex("Invalid input");
throw exception(ex);
}
int leftLength = rootInorder-startInorder; //获取左子树的长度
int* leftPreorderEnd = startPreorder+leftLength; //获取前序遍历中左子树结束指针位置
if(leftLength>0){ //构建左子树
root->m_pLeft = ConstructCore(startPreorder+1,leftPreorderEnd,startInorder,rootInorder-1);//用递归方法构建
}
if(leftLength<endPreorder-startPreorder){ //构建右子树
root->m_pRight = ConstructCore(leftPreorderEnd+1,endPreorder,rootInorder+1,endInorder);
}
return root;
}
BinaryTreeNode* Construct(int* preorder, int* inorder,int length){  
if(preorder==nullptr||inorder==nullptr||length<=0)
return nullptr;
return ConstructCore(preorder,preorder+length-1,inorder,inorder+length-1);
}

转载于:https://www.cnblogs.com/XiaoXiaMi123/p/8635892.html