I saw a question which is asking designing algorithm for “Post-order Tree Walk without marking node”.
What does this question mean?
I saw a question which is asking designing algorithm for Post-order Tree Walk without
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 saw a question which is asking designing algorithm for “Post-order Tree Walk without marking node”.
What does this question mean?
There are generally 3 ways to visit nodes in a tree: pre-order, in-order, post-order.
Pre-order means you process the node before processing the children.
In-order means you process the the left children (assuming here that it is a binary tree), then the current node, then the right children.
Post-order means you process a node after processing both children.
“Processing a node” could by any operation on a node, as simple as writing the stored payload of the node to the console.
Doing it without marking means not using an indicator (usually an extra field in the node) to show that a node has been visited. As Peter G. mentioned, the indicator should not be needed with recursive implemenations.