Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit a6965ba

Browse files
Merge pull request #154 from aymansharma/master
Convert_Sorted_Array_to_Binary_Search_Tree
2 parents c538d74 + 811399a commit a6965ba

File tree

1 file changed

+12
-0
lines changed

1 file changed

+12
-0
lines changed
Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
class Solution:
2+
def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:
3+
def build(l: int, r: int) -> Optional[TreeNode]:
4+
if l > r:
5+
return None
6+
7+
m = (l + r) // 2
8+
return TreeNode(nums[m],
9+
build(l, m - 1),
10+
build(m + 1, r))
11+
12+
return build(0, len(nums) - 1)

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /