int FindKthSmallest(TreePointer ptr){
int count=0;
if(ptr){
FindKthSmallest(ptr->leftchild);
count++;
FindKthSmallest(ptr->rightchild);} return count; } -- 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.
