@ankit, sorry i was mistaken its O(nlogn) for searching the two elements...
On Mon, Jun 27, 2011 at 8:04 PM, Swathi wrote:
> Dave,
>
> Can you provide the psuedo code for this..
>
> Thanks,
> Swathi
>
>
> On Mon, Jun 27, 2011 at 7:30 PM, Dave wrote:
>
>> @Sunny. Mea culpa. You are correct. Revi
HI
Do an inorder traversal on that bst n form a sorted array...then u can
search for that 2 elements in O(n)
On Mon, Jun 27, 2011 at 2:01 PM, manish kapur wrote:
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group
