http://codepad.org/ricAcQtu
On Sun, Jun 13, 2010 at 9:13 PM, Anand <[email protected]> wrote: > Here is an implementation for BST and search an element in BST in O(logn ) > time > > > On Sun, Jun 13, 2010 at 8:04 PM, Lekha <[email protected]> wrote: > >> Inorder traversal till u reach the kth element(If it is sorted in >> descending order, otherwise go till (n-k)th element).. >> >> >> On Sun, Jun 13, 2010 at 9:24 PM, Rohit Saraf <[email protected] >> > wrote: >> >>> Repeated q. Search in the group >>> >>> -- >>> -------------------------------------------------- >>> Rohit Saraf >>> Second Year Undergraduate, >>> Dept. of Computer Science and Engineering >>> IIT Bombay >>> http://www.cse.iitb.ac.in/~rohitfeb14 >>> >>> -- >>> 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]<algogeeks%[email protected]> >>> . >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >>> >> >> >> -- >> Lekha >> >> -- >> 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]<algogeeks%[email protected]> >> . >> 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 [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.
