根據(jù)前序和中序重構(gòu)二叉樹(shù)

1、#include#includeusing namespace std;struct TreeNode int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) ;class Solution public:struct TreeNode* reConstructBinaryTree(vector pre, vector in) vector:iterator ibegin, iend,begin,end;ibegin = pre.begin();iend = pre.

2、end();begin = in.begin();end = in.end();struct TreeNode *newnode = new struct TreeNode(*ibegin);vectornewpre1;vectornewpre2;vectornewin1;vectornewin2;int count = 0;for (; begin != end; )if (*begin= *ibegin)begin+;break;newin1.push_back(*begin);begin+;count+;for (; begin != end; begin+)newin2.push_ba

3、ck(*begin);ibegin+;for (int i=0; ibegin != iend;i+)if (i right = reConstructBinaryTree(newpre2, newin2);if (!newpre1.empty() newnode-left = reConstructBinaryTree(newpre1, newin1);return newnode;void show(struct TreeNode *mytreenode)if (mytreenode = NULL)return;show(mytreenode-left);show(mytreenode-r

4、ight);cout val ;int main()vectormyvector1;vectormyvector2;myvector1.push_back(1);myvector1.push_back(2);myvector1.push_back(4);myvector1.push_back(7);myvector1.push_back(3);myvector1.push_back(5);myvector1.push_back(6);myvector1.push_back(8);myvector2.push_back(4);myvector2.push_back(7);myvector2.push_back(2);myvector2.push_back(1);myvector2.push_back(5);myvector2.push_back(3);myvector2.push_back(6);myvector2.push_back(8);Solution mys;struct TreeNode *p=mys.reConst