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.

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

Create Unsorted arr to balanced bst.py #46

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
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
19 changes: 19 additions & 0 deletions Trees/Unsorted arr to balanced bst.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
'''
This creates a BALANCED BST from an unsorted array.

Tree() is a class create instance of a root node. (This is already implemented in other files in the repo)
'''

def toBst(arr):
arr.sort()
def toBalanced(arr):
if(not arr):
return None

mid=len(arr)//2
root=Tree(arr[mid])
root.left=toBalanced(arr[0:mid])
root.right=toBalanced(arr[mid+1:])

return root
return toBalanced(arr)