Question: 3. For a binary tree (not necessary a BST), we are given the following information preorder traversal sequence : D F I G T A
3. For a binary tree (not necessary a BST), we are given the following information
preorder traversal sequence : D F I G T A L M X
postorder traversal sequence : I T G F L X M A D
Can you construct and draw the tree from the given ? If so, draw the tree. Is the tree unique? If the tree is not unique, how many possible binary tree with the given pair of traversal sequences?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
