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 algoge...@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.