Question: The following three are the traversal sequence for preorder, inorder and postorder of a binary tree. 1. 33 27 77 25 55 53 67

The following three are the traversal sequence for preorder, inorder and postorder 

The following three are the traversal sequence for preorder, inorder and postorder of a binary tree. 1. 33 27 77 25 55 53 67 43 88 99 II. 99 55 27 33 25 77 88 43 53 67 III. 27 33 55 77 25 99 88 53 43 67 a) Analyse which one is preorder, inorder and postorder. Explain and show your work. (4 marks) b) Based on question 6, build the tree and answer the following questions: (4 marks) 1. What is the node of level 1 left subtree ii. What is the node of level 1 right subtree iii. List all parents with only right leaf iv. List all leaves of the tree

Step by Step Solution

3.42 Rating (158 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

0 Cal The first one I is postorder second II is preorder and third one III is inorde... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (2 attachments)

PDF file Icon

635e3aca1f483_182577.pdf

180 KBs PDF File

Word file Icon

635e3aca1f483_182577.docx

120 KBs Word File

Students Have Also Explored These Related Computer Engineering Questions!