Easy to Understand | Faster than 98% | Recursive | Simple | Python Solution
\n    def recursive(self, nums):\n        def rec(nums, start, end):\n            if start <= end:\n                mid = (start + end) // 2\n                no
```\n    def recursive(self, nums):\n        def rec(nums, start, end):\n            if start <= end:\n                mid = (start + end) // 2\n                node = TreeNode(nums[mid])\n                node.left = rec(nums, start, mid - 1)\n                node.right = rec(nums, mid + 1, end)\n                return node\n        return rec(nums, 0, len(nums) - 1)\n```\n\n**I hope that you\'ve found the solution useful.**\n*In that case, please do upvote and encourage me to on my quest to document all leetcode problems\uD83D\uDE03*\nPS: Search for **mrmagician** tag in the discussion, if I have solved it, You will find it there\uD83D\uDE38
['Recursion', 'Python', 'Python3']