@ rahul .. you can give the solution for both cases .. :-o
@ ashish :P
On Mon, Feb 7, 2011 at 9:23 PM, ashish agarwal wrote:
> jalaj back to algogeeks..
>
>
> On Mon, Feb 7, 2011 at 6:09 PM, rahul rai wrote:
>
>> Are all the integers positive only ?
>>
>> On 2/7/11, jalaj jaiswal wrote:
>> > y
jalaj back to algogeeks..
On Mon, Feb 7, 2011 at 6:09 PM, rahul rai wrote:
> Are all the integers positive only ?
>
> On 2/7/11, jalaj jaiswal 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 wi
Are all the integers positive only ?
On 2/7/11, jalaj jaiswal 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
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
/ \
110
/ \/ \
