C++基于先序、中序遍历结果重建二叉树的方法

#include <iostream>#include <vector>#include <stack>using namespace std;struct TreeNode {  int val;  TreeNode *left;  TreeNode *right;  TreeNode(int x) : val(x), left(NULL), right(NULL) {}};//创建二叉树算法TreeNode* reConstructBinaryTree(vector<int> pre, vector<int> mid){  int nodeSize = mid.size();  if (nodeSize == 0)    return NULL;  vector<int> leftPre, leftMid, rightPre, rightMid;  TreeNode* phead = new TreeNode(pre[0]); //第一个当是根节点  int rootPos = 0; //根节点在中序遍历中的位置  for (int i = 0; i < nodeSize; i++)  {    if (mid[i] == pre[0])    {      rootPos = i;      break;    }  }  for (int i = 0; i < nodeSize; i++)  {    if (i < rootPos)    {      leftMid.push_back(mid[i]);      leftPre.push_back(pre[i + 1]);    }    else if (i > rootPos)    {      rightMid.push_back(mid[i]);      rightPre.push_back(pre[i]);    }  }  phead->left = reConstructBinaryTree(leftPre, leftMid);  phead->right = reConstructBinaryTree(rightPre, rightMid);  return phead;}//打印后续遍历顺序void printNodeValue(TreeNode* root){  if (!root){    return;  }  printNodeValue(root->left);  printNodeValue(root->right);  cout << root->val<< " ";}int main(){  vector<int> preVec{ 1, 2, 4, 5, 3, 6 };  vector<int> midVec{ 4, 2, 5, 1, 6, 3 };  cout << "先序遍历序列为 1 2 4 5 3 6" << endl;  cout << "中序遍历序列为 4 2 5 1 6 3" << endl;  TreeNode* root = reConstructBinaryTree(preVec, midVec);  cout << "后续遍历序列为 ";  printNodeValue(root);  cout << endl;  system("pause");}/*测试二叉树形状：      1  2       3  4  5    6*/

先序遍历序列为 1 2 4 5 3 6中序遍历序列为 4 2 5 1 6 3后续遍历序列为 4 5 2 6 3 1请按任意键继续. . .