We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 8fd9364 commit d1b2ddcCopy full SHA for d1b2ddc
contents/tree_traversal/code/python/tree_traversal.py
@@ -84,7 +84,7 @@ def main():
84
dfs_recursive_postorder(tree)
85
print()
86
87
- print("[#] Stack-based DFS :")
+ print("[#] Stack-based DFS:")
88
dfs_stack(tree)
89
90
@@ -94,7 +94,7 @@ def main():
94
95
binary_tree = create_tree(Node(), 3, 2)
96
97
- print("[#] Recursive Inorder Binary Tree:")
+ print("[#] Recursive Inorder DFS for Binary Tree:")
98
dfs_recursive_inorder_btree(binary_tree)
99
100
0 commit comments