subarray prefix to the left of the maximum value.

Recursively build the right subtree on the subarray suffix to the right of the maximum value.

Return the maximum binary tree built from nums.

Examples

Example 1:

graph TD;
	F(6) --- C(3) & E(5)
	C ~~~ N1:::hidden
	C --- B(2)
	B ~~~ N2:::hidden
	B --- A(1)
	E --- G(0)
	E ~~~ N3:::hidden	
	
classDef hidden display:none

Input: nums = [3,2,1,6,0,5]
Output: [6,3,5,null,2,0,null,null,1]
Explanation: The recursive calls are as follow:

Related Tags