Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 12:16:14 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update bst_insert_node.py

Browse Source
This commit is contained in:
bt3gl 2023-08-08 15:46:10 -07:00 committed by GitHub
parent a3ce5db3a5
commit cb2909d421
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 15 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

33
trees/bst_insert_node.py
View File

@ -5,38 +5,35 @@
def bst_insert_iterative(root, val):
new_node = Node(val)
this_node = root
while this_node:
node = root
while node:
if val > this_node.val:
if not this_node.right:
this_node.right = new_node
return root
if val > node.val:
if not node.right:
node.right = Node(val)
break
else:
this_node = this_node.right
node = node.right
else:
if not this_node.left:
this_node.left = new_node
return this_node
if not node.left:
node.left = Node(val)
break
else:
this_node = this_node.left
node = node.left
return new_node
return root
def bst_insert_recursive(root, val):
if not root:
if root is None:
return Node(val)
if val > root.val:
root.right = self.insertIntoBST(root.right, val)
root.right = self.bst_insert_recursive(root.right, val)
else:
root.left = self.insertIntoBST(root.left, val)
root.left = self.bst_insert_recursive(root.left, val)
return root