On 1/31/2012 8:29 AM, Warp wrote:
>
>    Since elements in a BST usually have pointers to each other anyways,
> and since merging two linked lists can be done without requiring any
> additional memory, this whole operation might be possible using O(1)
> memory.

I have the same intuition, although I don't care enough to code it up 
work out the details.

Post a reply to this message