candis
BAN USER
Comments (8)
Reputation 0
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
Pick the first elemnet of Pre[] and search for it in In[]. Make it the root of the tree. LEft of the node contains the elements of In[] before the root (repeat the process recuursively with new Pre[] containing the same number of elements as the In[] for left and contain the elements from left to right).....Similarly for right node
- candis April 16, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
Pick the first elemnet of Pre[] and search for it in In[]. Make it the root of the tree. LEft of the node contains the elements of In[] before the root (repeat the process recuursively with new Pre[] containing the same number of elements as the In[] for left and contain the elements from left to right).....Similarly for right node
- candis April 16, 2012Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
@sasi: can u plz provide yr code on the forum.......
- candis April 17, 2012