Maximum Binary Tree (LeetCode 654) | Full Solution with a natural way to approach | Recursion

[@lonen3rd]

This is how I did it, in Python. I'm not sure what the overall time complexity is considering there are two O(n) operations for every DFS call where nums is not empty. class Solution: def constructMaximumBinaryTree(self, nums: List[int]) -> Optional[TreeNode]: if not nums: return max_num = max(nums) max_index = nums.index(max_num) root = TreeNode(max_num) root.left = self.constructMaximumBinaryTree(nums[:max_index]) root.right = self.constructMaximumBinaryTree(nums[max_index+1:]) return root

[@abdulmutaalazhar8235]

Hi, really nice explanation. Thank you btw, which drawing pad and drawing software are you using ?

[@nikoo28]

that is GoodNotes 6

[@tanishkaagarwal6750]

Wonderful explanation

[@AniketWaghmare-qi7wm]

Hey Nikhil Please Make Video On leetcode Question Number 1448. count Good Nodes in Binary Tree using java

[@subee128]

Thanks

[@ritikanand3425]

Great Explanation

[@nikoo28]

Glad you liked it

[@rjarora]

Bhai brute force bata dia ye to

[@nikoo28]

What do you mean?

[@athirap2529]

@@nikoo28 I think he meant it's a brute force solution