void kthsmallest(Tree *node,int k)
{
static int count=0;
if(node!=NULL && count!=k)
{
kthsmallest(node->left);
printf("\nKth Smallest - - %d\n",node->data);
kthsmallest(node->right);
}
}-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
