🚀 go-pugleaf

In article <490g78$h9f@sundog.tiac.net>, Scott Dares & Christina Edwards <pools@tiac.net> writes:
|> Organization: The Internet Access Company
|> Lines: 10
|> Message-ID: <490g78$h9f@sundog.tiac.net>
|> NNTP-Posting-Host: pools.tiac.net
|> Mime-Version: 1.0
|> Content-Type: text/plain; charset=us-ascii
|> Content-Transfer-Encoding: 7bit
|> X-Mailer: Mozilla 1.22 (Windows; I; 16bit)
|> 
|> Does anyone know where I can get an algorithm for deleting a node from
|> an avl tree and maintaining the tree's balance after the deletion?  It
|> appears that most of the data structure textbooks leave this algorithm
|> up to the programmer.
|> 
|> I would appreciate any help.
|> 
|> Thanks
|> Christina
|> 

You can find this algorithm in the new  book of prof. Broy (Munich University 
of Technology) :

Broy, Manfred
Informatik IV
Springer, 1995.

There is a complete implementation of the AVL-Trees.

If you don't have access to german books (or you don't speek german), so write me
a email - i will copy the code and send you a fax. (The are a lot of cases , so
the algorithm is 2-3 pages long).


-- 
+---------------------------------------------+
| Sergei Sokolenko                            |
| sokolenk@informatik.tu-muenchen.de          |
+---------------------------------------------+