asmhatre/java-interview-lab
1
0
Fork 0
Code Activity

New posts

Browse Source
This commit is contained in:
asmhatre
2026-11-06 21:43:33 +05:30
parent 8d8d7956ba
commit 4a9021d936
34 changed files with 1778 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
binary-tree-traversals/output/01-sample-tree-all-traversals.txt
+21
View File
@@ -0,0 +1,21 @@
Sample tree: every traversal, recursive and iterative
=====================================================
tree (value(left,right), - = no child): 1(2(4,5(7,-)),3(-,6(8,9)))
recursive inorder : [4, 2, 7, 5, 1, 3, 8, 6, 9]
recursive preorder : [1, 2, 4, 5, 7, 3, 6, 8, 9]
recursive postorder : [4, 7, 5, 2, 8, 9, 6, 3, 1]
iterative inorder : [4, 2, 7, 5, 1, 3, 8, 6, 9]
iterative preorder : [1, 2, 4, 5, 7, 3, 6, 8, 9]
iterative postorder (2 stacks): [4, 7, 5, 2, 8, 9, 6, 3, 1]
iterative postorder (1 stack) : [4, 7, 5, 2, 8, 9, 6, 3, 1]
Morris inorder : [4, 2, 7, 5, 1, 3, 8, 6, 9]
Morris preorder : [1, 2, 4, 5, 7, 3, 6, 8, 9]
tree after Morris : 1(2(4,5(7,-)),3(-,6(8,9))) (unchanged)
level order (queue) : [1, 2, 3, 4, 5, 6, 7, 8, 9]
level order by level : [[1], [2, 3], [4, 5, 6], [7, 8, 9]]
zigzag : [[1], [3, 2], [4, 5, 6], [9, 8, 7]]