There are 3 paths exist in bst, post, pre and inorder. store all these paths and find contiguous sum(and set of elements which leads to this sum) and check if it equals to given sum, then that is path.
On Dec 27, 6:48 pm, mohit ranjan <shoonya.mo...@gmail.com> wrote: > any hint for below question ? > > Mohit > > > > > > > > On Sun, Dec 26, 2010 at 10:38 PM, MAC <macatad...@gmail.com> wrote: > > you are given a bst where each node has a int value , parent pointer , and > > left and right pointers , write a function to find a path with a given sum > > value. Path can go from left subtree tree , include root and go to right > > tree as well . we need to find these paths also . > > > 5 > > 1 10 > > 0 2 6 11 > > > so to find 16 we say it is 1 to 5 to 10 > > > -- > > thanks > > --mac > > > -- > > 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. -- 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.
