5.2.2—二叉树的构建—Construct Binary Tree from Inorder and Postorder Traversal

描述
Given inorder and postorder traversal of a tree, construct the binary tree.
Note: You may assume that duplicates do not exist in the tree.

#include "BinaryTree.h"#include<vector>using namespace std;//===由后序和中序构建二叉树BinaryTreeNode* ConBinTreeFromPostAndMid(int post[],int postbegin, int mid[], int midbegin,int length){if (length <= 0) return NULL;BinaryTreeNode* proot = CreateBinaryTreeNode(post[postbegin+length-1]);ConnectTreeNodes(proot, NULL,NULL);int index = midbegin;for (int i = midbegin; i < midbegin+length; i++){if (post[postbegin + length - 1] == mid[i]){index = i; break;}}int prelength = index - midbegin;int lastlength = length - prelength-1;proot->m_pLeft=ConBinTreeFromPostAndMid(post, postbegin, mid, midbegin,prelength);proot->m_pRight = ConBinTreeFromPostAndMid(post, postbegin+prelength,mid ,index + 1,lastlength);return proot;}// ====================测试代码====================int main(){const int n = 9;int post[n] = { 7, 8, 5, 3, 4, 9, 10, 11,1};int mid[n] = { 7, 5, 8, 1, 3, 9, 4, 11,10};BinaryTreeNode *proot = ConBinTreeFromPostAndMid(post,0, mid,0,n);PrintTree(proot);DestroyTree(proot);}