Not clear what path you are referring to.
Question. Should the path include root value always? (What is problem
with only left or only right path (not containing root))
In your example for 16 one more path can be 0 1 5 10 as
well. Should algo return all the paths or just first one.
On Dec 26, 10:08 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.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
