Leetcode Problem 654. Maximum Binary Tree

654. Maximum Binary Tree

Leetcode Solutions

Define a recursive function construct(nums, l, r) that takes a subarray defined by indices l and r.
If l == r, return None as there are no elements to form a tree.
Find the index max_i of the maximum element in the subarray nums[l:r].
Create a new tree node root with the value nums[max_i].
Recursively construct the left subtree with construct(nums, l, max_i) and assign it to root.left.
Recursively construct the right subtree with construct(nums, max_i + 1, r) and assign it to root.right.
Return the root node.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen