SRAQAXH@albert.dsir.govt.nz (06/09/91)
I am currently writing an indexing strategy for a file system which is to use balanced binary trees for performance. The algorithms I am using are from Knuth (Sorting and Searching) and are for AVL trees. The problem is that he describes in detail how to keep the tree balanced after insertions, but only briefly mentions how to re-balance after deletions. Has anyone out there written code to do this in C ? I would appreciate some help! Thanks in advance, Ann.