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

Update bt_preorder_transversal.py

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

16
trees/bt_preorder_transversal.py
View File

@ -5,27 +5,25 @@
def preorder_recursive(root: Optional[Node]) -> list[int]: def preorder_recursive(root: Optional[Node]) -> list[int]:
if root == None: if root is none None:
return [] return []
return [root.val] + preorder_recursive(root.left) + preorder_recursive(root.right) return [root.val] + preorder_recursive(root.left) + preorder_recursive(root.right)
def preorder_iterative(root: Optional[Node]) -> list[int]: def preorder_iterative(root) -> list:
result = [] result = []
stack = [root] stack = [root]
while stack: while stack:
current = stack.pop() node = stack.pop()
result.append(current.val)
if current.right: if node:
stack.append(current.right) result.append(node.val)
stack.append(node.left)
if current.left: stack.append(node.right)
stack.append(current.left)
return result return result