Weight-balanced trees

Weight-balanced trees,10.1145/1499949.1500040,Jean-loup Baer

Weight-balanced trees   (Citations: 11)
BibTex | RIS | RefWorks Download
It is now recognized that binary search trees are structures which can be used efficiently for the organization of files and directories. The ease of insertion and deletion of nodes makes trees very appealing for directories which are often modified. By comparison with a sequential table organization, some additional memory is required for the links between nodes. From a cost-effective viewpoint, this is generally more than compensated for by the savings in searching (for a linear table) and inserting (for an ordered table).
Conference: AFIPS Spring Conference - AFIPS , pp. 467-472, 1975
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: