1. For a binary tree with nine nodes, the result of inorder traversal is : D B A G E C H F I. And that of postorder traversal isBig GrinBGEHIFCA. Then the result of preorder traversal is :
Terms And Service:We do not guarantee the accuracy of available data ..We Provide Information On Public Data.. Please consult an expert before using this data for commercial or personal use