Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:
- The root is the maximum number in the array.
- The left subtree is the maximum tree constructed from left part subarray divided by the maximum number.
- The right subtree is the maximum tree constructed from right part subarray divided by the maximum number.
Construct the maximum tree by the given array and output the root node of this tree.
Example 1:
Input: [3,2,1,6,0,5]
Output: return the tree root node representing the following tree:
6
/ \
3 5
\ /
2 0
\
1
Note:
- The size of the given array will be in the range [1,1000].
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: TreeNode* constructMaximumBinaryTree(vector<int>& nums) { return getMaxTree(nums,0,nums.size()-1); } TreeNode* getMaxTree(vector<int>& nums,int start,int end){ int max,index; max=nums[start]; index=start; if(start>end) { return NULL; } for(int i=start+1; i<=end; i++) { if(nums[i]>max) { max=nums[i]; index=i; } } TreeNode* root=new TreeNode(max); root->left=getMaxTree(nums,start,index-1); root->right=getMaxTree(nums,index+1,end); return root; } };
本文介绍了一种基于给定整数数组构建最大二叉树的方法。该树的根节点为数组中的最大值,左右子树则分别由最大值划分的左右部分数组递归构建而成。文章提供了详细的算法实现步骤及示例。

被折叠的 条评论
为什么被折叠?



