can v use AVL trees for this>/?
On Sun, Jul 6, 2008 at 1:16 PM, Balachander <[EMAIL PROTECTED]>
wrote:
>
> How Do u basically find the Median of BST in place ?
> Are u trying to find the median just by traversing once ?
>
> /
> Bala
> >
>
--~--~-~--~~~---~--~~
You
How Do u basically find the Median of BST in place ?
Are u trying to find the median just by traversing once ?
/
Bala
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, se
Try to use a BST.
The idea is to keep the median as the root node for every subtree.
-- barata
On Jul 2, 1:44 pm, zee <[EMAIL PROTECTED]> wrote:
> what data structure should we use to find the median of a given set of
> numbers ..
>
> the data structure should support insert , delete and the ret
