Rebalancing binary trees 
Author Message
 Rebalancing binary trees
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.



Fri, 26 Nov 1993 00:25:24 GMT
 
 [ 1 post ] 

 Relevant Pages 

1. binary-tree, B-tree

2. Binary Tree Traversal in SQL SERVER 2000

3. Binary Search Tree

4. trouble with linked lists and binary search trees....

5. Binary Search Tree

6. PS/SQL for constructing binary tree for pedigree?

7. iFS and versioning control of binary files trees

8. Binary Tree

9. Binary tree

10. Binary tree.

11. Store binary tree

12. Binary Tree in FP?


 
Powered by phpBB® Forum Software