#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) {}
};
//創(chuàng)建二叉樹算法
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]); //第一個當是根節(jié)點
  int rootPos = 0; //根節(jié)點在中序遍歷中的位置
  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;
}
//打印后續(xù)遍歷順序
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 << "后續(xù)遍歷序列為 ";
  printNodeValue(root);
  cout << endl;
  system("pause");
}
/*
測試二叉樹形狀：
      1
  2       3 
 4  5    6
*/

先序遍歷序列為 1 2 4 5 3 6
中序遍歷序列為 4 2 5 1 6 3
后續(xù)遍歷序列為 4 5 2 6 3 1
請按任意鍵繼續(xù). . .