Siavash Khallaghi siavashk
siavashk
/ dfs_iterative_binary_tree_traversal.py
Last active
December 1, 2024 22:40
DFS Iterative Binary Tree Traversal
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # class TreeNode: | |
| # def __init__(self, val=0, left=None, right=None): | |
| # self.val = val | |
| # self.left = left | |
| # self.right = right | |
| def iterative_pre_order_traversal(root: TreeNode): | |
| stack = [root] | |
| while stack: |
siavashk
/ dfs_recursive_binary_tree_traversal.py
Last active
November 30, 2024 21:19
DFS Recursive Binary Tree Traversal
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # class TreeNode: | |
| # def __init__(self, val=0, left=None, right=None): | |
| # self.val = val | |
| # self.left = left | |
| # self.right = right | |
| def recursive_inorder_traversal(root: TreeNode): | |
| if not root: | |
| return |
NewerOlder