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 PostC K F H D B G
Hey, do you have an image of what the tree actually looks like?
Thanks :)
Jump to PostE 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?
All 5 Replies
phorce
131
Posting Whiz in Training
Featured Poster
shibu2all
-1
Newbie Poster
zeroliken
79
Nearly a Posting Virtuoso
TrustyTony
888
pyMod
Team Colleague
Featured Poster
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.