Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

all tests passed #100

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

all tests passed #100

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 15 additions & 1 deletion binary_search_trees/array_to_bst.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,4 +10,18 @@ def arr_to_bst(arr):
Balanced Binary Search Tree using the elements in the array.
Return the root of the Binary Search Tree.
"""
pass
if not arr:
return None

mid_point = len(arr)//2

root = TreeNode(arr[mid_point])

# while there is something to the left of this point, set nodes for the left
root.left = arr_to_bst(arr[:mid_point])

# while there is something to the right of this point, set nodes for the right
root.right = arr_to_bst(arr[mid_point + 1:])


return root