class Solution(object): def sortedArrayToBST(self, a): if not a:return m=len(a)//2 r=TreeNode(a[m]) r.left=self.sortedArrayToBST(a[:m]) r.right=self.sortedArrayToBST(a[m+1:]) return r
-
Notifications
You must be signed in to change notification settings - Fork 0
Sahithya-2007/Convert-sorted-array-to-binary-search-tree
About
class Solution(object): def sortedArrayToBST(self, a): if not a:return m=len(a)//2 r=TreeNode(a[m]) r.left=self.sortedArrayToBST(a[:m]) r.right=self.sortedArrayToBST(a[m+1:]) return r
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published