Re: [algogeeks] Recursion help!

2010-06-04 Thread satwik krishna
i think the best way to trace is to draw a picture of the stack and put the values and acc understand the flow On Fri, Jun 4, 2010 at 7:22 AM, Prashant Kulkarni prashant.r.k...@gmail.com wrote: int Max(int a[],int n) { int max; if(n==1)

Re: [algogeeks] k the smallest in BST without using static variable

2010-05-16 Thread satwik krishna
@Rohit Can u pass on thje link of morris inorder On 5/15/10, Rohit Saraf rohit.kumar.sa...@gmail.com wrote: there is something called morris inorder traversal. credits to donald knuth On 5/15/10, kaushik sur kaushik@gmail.com wrote: Hi Friends I have encountered the question in