got it thanks

On Mon, Aug 8, 2011 at 10:30 PM, Akash Mukherjee <akash...@gmail.com> wrote:

> i think its 1 though .......
>
>
> On Mon, Aug 8, 2011 at 10:21 PM, rohit <rajuljain...@gmail.com> wrote:
>
>> What will the following code snippet do, when is it passed the root of
>> a binary tree ?
>> func( Node *node){
>>
>>  if(node->right != NULL)
>>
>>       func( node->right);
>>
>>  if(node->left != NULL)
>>
>>        func( node->left);
>>
>>  if( node->left == NULL && node->right == NULL )
>>
>>     delete(node);
>>
>> }
>>
>> Pick choice
>> Delete the tree from bottom to top
>>
>> Delete the tree from top to bottom
>>
>> Delete the leaf nodes from right to left
>>
>> Delete the leaf nodes from left to right
>>
>> I think it is 3
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@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.
>>
>>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@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.
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@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.

Reply via email to