-
Notifications
You must be signed in to change notification settings - Fork 0
/
106.cpp
83 lines (73 loc) · 2.02 KB
/
106.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#include <iostream>
#include <vector>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
TreeNode* build(vector<int> & inorder, vector<int> & postorder,int in_left ,int in_right,int post_left,int post_right)
{
// cout<<in_left<<" "<<in_right<<" "<<post_left<<" "<<post_right<<" 123"<<endl;
if(post_left>post_right)
return NULL;
else
{
TreeNode *node=new TreeNode(postorder[post_right]);
int i;
for(i=in_left;i<=in_right;i++)
if(inorder[i]==postorder[post_right])
break;
node->left=build(inorder,postorder,in_left,i-1,post_left,post_left+i-1-in_left);
node->right=build(inorder,postorder,i+1,in_right,post_left+i-in_left,post_right-1);
return node;
}
}
TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
return build(inorder,postorder,0,inorder.size()-1,0,postorder.size()-1);
}
};
void output(TreeNode * tree)
{
if(tree==NULL)
return ;
else
{
cout<<tree->val<<endl;
output(tree->left);
output(tree->right);
}
}
int main()
{
vector<int> inorder;
inorder.push_back(4);
inorder.push_back(2);
inorder.push_back(6);
inorder.push_back(5);
inorder.push_back(1);
inorder.push_back(3);
inorder.push_back(10);
inorder.push_back(8);
inorder.push_back(7);
inorder.push_back(9);
vector<int> postorder;
postorder.push_back(4);
postorder.push_back(6);
postorder.push_back(5);
postorder.push_back(2);
postorder.push_back(10);
postorder.push_back(8);
postorder.push_back(9);
postorder.push_back(7);
postorder.push_back(3);
postorder.push_back(1);
Solution s;
TreeNode *tree=s.buildTree(inorder,postorder);
cout<<"____________________"<<endl;
output(tree);
return 0;
}