654. Maximum Binary Tree

最新推荐文章于 2021-01-02 09:59:03 发布

且听疯吟

最新推荐文章于 2021-01-02 09:59:03 发布

阅读量173

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/mml1106/article/details/77825018

leetcode 专栏收录该内容

84 篇文章

订阅专栏

本文介绍了一种构建最大二叉树的方法，通过寻找数组中的最大值作为根节点，并递归构造左右子树。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

struct TreeNode* constructMaximumBinaryTree(int* nums, int numsSize) {
    int i = 0;
    int max = 0;
    struct TreeNode * root = NULL;

    if(numsSize <= 0){
        return NULL;
    }

    max = 0;

    for(i = 1;i < numsSize; ++i){
        if(nums[i]>nums[max]){
            max = i;
        }
    }

    root = (struct TreeNode *)malloc(sizeof(struct TreeNode));
    root->val = nums[max];
    root->left = constructMaximumBinaryTree(nums,max);
    root->right = constructMaximumBinaryTree(nums+max+1,numsSize - max -1);

    return root;
}