data being accessed. They're balanced trees used for fast searches, on
the order of O(lg(n)).
--BenD
jon hall wrote:
> Oh cool...new tree type...I've been really interested in them as of
> late. Definitely one of those topics where a CS education is
> necessary.
> But, if you wouldn't mind humoring me, what kinds of applications
> could use a balanced tree like AVL?
> >From this page
> http://ciips.ee.uwa.edu.au/~morris/Year2/PLDS210/AVL.html it seems
> from the graphic that 'rotating' to keep the balance kills the
> parent-child relationship, which would seem to be a bad thing.
>
> --
> jon
> mailto:[EMAIL PROTECTED]
>
> Wednesday, October 1, 2003, 2:47:10 PM, you wrote:
> MS> Hmmm... ok. But nobody's creating any linked lists or AVL trees
> using CF, at least as far as I know.
[Todays Threads] [This Message] [Subscription] [Fast Unsubscribe] [User Settings]
