void find(struct node * tree,struct node *subtree)
{
if((tree==NULL )||(subtree==NULL))
return ;
else
{
printf("the data being compared are tree:%d subtree:%d
\n",tree->data,subtree->data);
if((tree->data)==(subtree->data))
{
flag=1;
find(tree->left,subtree->left);
find(tree->right,subtree->right);
}
else
{
flag=0;
find(tree->left,subtree);
find(tree->right,subtree);
}
}
}
// flag is a global variable to check wehtr ts a subtree or not
On Sat, Aug 13, 2011 at 10:08 PM, Yasir <yasir....@gmail.com> wrote:
> ........
>
> .......
>
> if(something)
> return true;
> else
> return false;
> .....
> // few statements here
>
> .....
>
>
> Will few statements ever execute??
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To view this discussion on the web visit
> https://groups.google.com/d/msg/algogeeks/-/zTXTyMwcDGAJ.
>
> 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.
