From: James Gray <james@...>
Date: 2007-12-16T00:24:46+09:00
Subject: Re: AVL Tree

On Dec 15, 2007, at 8:23 AM, Rick DeNatale wrote:

> On 12/14/07, James Gray <james@grayproductions.net> wrote:
>> On Dec 14, 2007, at 2:37 PM, thefed wrote:
>>
>>> I have a quick question about the AVL tree. Isn't this a lot like
>>> the Rope quiz? When I wrote my Rope entry, I made it into a self-
>>> balancing tree like this (although I forsaked all heap properties).
>>
>> Some people did use AVL balancing in their ropes, but I consider the
>> binary tree to be a more general data structure.
>>
>> Beyond that, this quiz is far more about the build strategy than the
>> task itself.
>
>
> I hope this is taken the right way, but as I think of this quiz, I'm
> afraid that picking a particular data structure/algorithm like an AVL
> tree isn't the best way to do that.

I'm sure I make plenty of mistakes.  This could be one of them.

However, when there are no submissions, you're stuck with my ideas for  
better and worse.  I like to try new things from time to time.

I also don't see anything wrong with TDDing an algorithm.  Besides  
that, there should be a heck of a lot more interface work than there  
is AVL rotations in our tree library.

James Edward Gray II