On Mon, Jan 3, 2011 at 6:08 PM, juver++ <avpostni...@gmail.com> wrote:
> Tree structure already have parent node link. Even we reconstruct the tree > as linked list we are not allowed to achieve Normal tree node does not contain link to its parent. I am not saying convert tree into linklist directly. I want to say that convert tree into a branched list(not linear) in which each node can have (at max) 2 nodes as its next. Further u can add some extra fields into ur node struct for optimal solution. > the goal. Path can be combined using non-contigious (created from inorder > traversal) elements. The only solution is using DP with O(MAX_SUM_VALUE) > extra space for each node. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Regards, Rahul Patil -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
