Can any one help me to solve this.
When inorder traversing a tree resulted E A C K F H D B G; the preorder and postorder traversal would return
shibu2all -1 Newbie Poster
Recommended Answers
Jump to PostInorder -> E is the root, I think.
The problem is when to move from innode to child nodes. I suspect that this is supposed to be balanced binary tree, but even that is not given by th poster. In that case A would be left child and H right …
Jump to PostIs this even possible?
http://www.cs.rutgers.edu/~kaplan/503/handouts/btreconNgentrees.html
All 5 Replies
phorce 131 Posting Whiz in Training Featured Poster
C K F H D B G
Hey, do you have an image of what the tree actually looks like?
Thanks :)
shibu2all -1 Newbie Poster
no tree structure was provided for this...question was taken from placement papers
zeroliken 79 Nearly a Posting Virtuoso
E A C K F H D B G
there can be a lot of ways for the elements to be created in an inorder traversal from a tree which makes a lot of possible preorder or postorder solution
is the root node/element given at least?
TrustyTony 888 ex-Moderator Team Colleague Featured Poster
Inorder -> E is the root, I think.
The problem is when to move from innode to child nodes. I suspect that this is supposed to be balanced binary tree, but even that is not given by th poster. In that case A would be left child and H right child.
iamthwee
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.