RSS

How can you get a tree back if traversal of tree output is given

Fri, Mar 5, 2010

Algorithm

BST can be constructed if
preorder/postorder+inorder is given
Not possible if preorder+postorder is given
Also refer this link for more algorithm/code regarding this problem

Sharing ~ Helping Other:
  • Print
  • email
  • Digg
  • del.icio.us
  • Facebook
  • Google Bookmarks
  • BlinkList
  • DZone
  • Slashdot
  • YahooMyWeb
  • StumbleUpon
  • Live
  • IndianPad
  • DotNetKicks
  • Technorati

Other Posts:

This post was written by:

eXclusiveMinds - who has written 500 posts on eXclusiveMinds.


Contact the author

Leave a Reply

You must be logged in to post a comment.