Need help with #2 All in java language Page( 3. Binary Tree Traversals. (10 pta)
ID: 3904311 • Letter: N
Question
Need help with #2 All in java language
Page( 3. Binary Tree Traversals. (10 pta) Consider the following tree. 1. 13 rili in each of the traversals belows Preorder traversal Inorder traversal Tor each traversal put/add the vatues in an inaginary Stack and a Queue tter they are read from the tree. After traversing the tree, write riil in each of the tzaversals below Preonder traversal put in Queue: tnorder traversal put in Qceue s Postorder traversal put in Queues Preender sraversal put in Stacki Inonder traversal put in Stacki Postorder traversal put in Stacki or Quece 5 8Explanation / Answer
3.
Preorder Traversal : 4 2 7 6 11 3 1 8 10 9 5
Inorder Traversal : 6 7 11 2 3 4 10 8 1 5 9
Postorder Traversal : 6 11 7 3 2 10 8 5 9 1 4
Preorder Traversal put in Queue : 4 2 7 3 6 11 $ $ 1 8 9 10 $ $ 5
Inorder Traversal put in Queue : 2 7 3 6 11 $ $ 4 1 8 9 10 $ $ 5
Postorder Traversal put in Queue : 2 7 3 6 11 $ $ 1 8 9 10 $ $ 5 4
Preorder Traversal put in Stack : Top-> 4 2 7 6 11 3 1 8 10 9 5 (5 is pushed first)
Inorder Traversal put in Stack : Top->6 7 11 2 3 4 10 8 1 5 9(9 is pushed first)
Postorder Traversal put in Stack : Top->6 11 7 3 2 10 8 5 9 1 4( 4 is pushed first)
Do ask if any doubt. Please upvote.