1 class Solution
 2 {
 3     public:
 4         vector<int> nums;
 5         void PreOrder(TreeNode* T)
 6         {
 7             if(T!=NULL)
 8             {
 9                 PreOrder(T->left);
10                 nums.push_back(T->val);
11                 PreOrder(T->right);
12             }
13         }
14         TreeNode* insertIntoMaxTree(TreeNode* root, int val)
15         {
16             PreOrder(root);
17             nums.push_back(val);
18             return constructMaximumBinaryTree(nums);
19         }
20         TreeNode* constructMaximumBinaryTree(vector<int>& nums)
21         {
22             if(nums.size()==0)return NULL;
23             else if(nums.size()==1)
24             {
25                 TreeNode * node=new TreeNode(nums[0]);
26                 return node;
27             }
28             else
29             {
30                 int max=0;
31                 for(int i=0; i<nums.size(); i++)
32                 {
33                     if(nums[i]>nums[max])
34                         max=i;
35                 }
36                 vector<int> left_num,right_num;
37                 for(int i=0; i<max; i++)
38                 {
39                     left_num.push_back(nums[i]);
40                 }
41                 for(int j=max+1; j<nums.size(); j++)
42                 {
43                     right_num.push_back(nums[j]);
44                 }
45                 TreeNode * node=new TreeNode(nums[max]);
46                 node->left=constructMaximumBinaryTree(left_num);
47                 node->right=constructMaximumBinaryTree(right_num);
48                 return node;
49             }
50         }
51 };