(a) Draw a binary tree with 10 nodes labeled 0, 1,..., 9 in such a way...

   

Transcribed Image Text:

(a) Draw a binary tree with 10 nodes labeled 0, 1,..., 9 in such a way that the inorder and postorder traversals of the tree yield the following lists: 4, 1,6,3,9,2,5,7,0,8 (inorder) and 6, 1,4,9, 0, 7, 5, 8, 2, 3 (postorder). (b) Give an example of two permutations of the same n labels 0, 1,...,n 1 that cannot be inorder and postorder traversal lists of the same binary tree. (c) Design an algorithm that constructs a binary tree for which two given lists of n labels 0,1,...,n 1 are generated by the inorder and postorder traversals of the tree. Your algorithm should also identify inputs for which the problem has no solution (a) Draw a binary tree with 10 nodes labeled 0, 1,..., 9 in such a way that the inorder and postorder traversals of the tree yield the following lists: 4, 1,6,3,9,2,5,7,0,8 (inorder) and 6, 1,4,9, 0, 7, 5, 8, 2, 3 (postorder). (b) Give an example of two permutations of the same n labels 0, 1,...,n 1 that cannot be inorder and postorder traversal lists of the same binary tree. (c) Design an algorithm that constructs a binary tree for which two given lists of n labels 0,1,...,n 1 are generated by the inorder and postorder traversals of the tree. Your algorithm should also identify inputs for which the problem has no solution

Answer rating: 100% (QA)

A In postorder traversal the last node is always the root Using the root found in step 1 find this root in the inorder traversal The elements to the l... View the full answer