void kSmallestBST(struct node * root,int k){
static int count=0;
if(!root) return;
kSmallestBST(root->left,k);
if(++count==k) {cout<<root->data; return;}
kSmallestBST(root->right,k);
}
--
Thanks & Regards,
Priyanka Chatterjee
Final Year Undergraduate Student,
Computer Science & Engineering,
National Institute Of Technology,Durgapur
India
http://priyanka-nit.blogspot.com/
--
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.
