Previous in Forum: Search in Graphs   Next in Forum: Facebook Enables Facial Recognition
Close
Close
Close
3 comments
Rate Comments: Nested
Member

Join Date: Jun 2011
Location: Delhi,India
Posts: 7

Construct a Tree by Inorder and Postorder Traversals

06/07/2011 8:23 AM

please tell me how if following inorder and postorder traversals are given, can we construct the tree? I was unable to construct some contradiction is coming.

POSTORDER : D K E C H Q J I B A

INORDER : D C K E A H B Q J I

__________________
Self-Belief is the key of every hurdle.
Register to Reply
Interested in this topic? By joining CR4 you can "subscribe" to
this discussion and receive notification when new comments are added.
Guru

Join Date: Oct 2008
Posts: 42355
Good Answers: 1693
#1

Re: Construct a Tree by Inorder and Postorder Traversals

06/07/2011 8:41 AM
Register to Reply
Guru
Engineering Fields - Electromechanical Engineering - Technical Services Manager Canada - Member - Army brat Popular Science - Cosmology - What is Time and what is Energy? Technical Fields - Architecture - Draftsperson Hobbies - RC Aircraft - New Member

Join Date: Sep 2006
Location: Clive, Alberta, Canada
Posts: 5916
Good Answers: 204
#2

Re: Construct a Tree by Inorder and Postorder Traversals

06/07/2011 11:49 PM

I don't understand what you are asking.

what tree? is this a programming question? a logic question?

what subject or topic are you trying to investigate?

chris

Register to Reply
Guru

Join Date: Oct 2010
Posts: 1294
Good Answers: 35
#3
In reply to #2

Re: Construct a Tree by Inorder and Postorder Traversals

06/09/2011 10:58 AM

It's a programming question. (Well, I guess some would call it logic as well... e.g., programming logic ;-)

Register to Reply
Register to Reply 3 comments
Copy to Clipboard

Users who posted comments:

chrisg288 (1); lyn (1); rhkramer (1)

Previous in Forum: Search in Graphs   Next in Forum: Facebook Enables Facial Recognition

Advertisement