I’ve given only a pre-order traversal sequence of a binary tree (e.g. {a, b, d, c, e}) and the task is to find out the in-order sequence from it. Pls pardon me if this is a duplicate question…. thanks
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I’ve given only a pre-order traversal sequence of a binary tree (e.g. {a, b, d, c, e}) and the task is to find out the in-order sequence from it. Pls pardon me if this is a duplicate question…. thanks
I don’t think you can find out the inorder traversal based on just the preorder traversal for a binary tree. As you said for binary search tree, sorting will give you the inorder traversal.