Weighted Leaf AVL-Trees

DOI10.1137/0216035MaRDI QIDQ3801089zbMATH OpenOpenAlexFDO

Authors Vijay K. Vaishnavi

Publication date 1987

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0216035

zbMATH Keywords

data structuredynamic databasesglobally biased treesinformation storage and retrievalsearch treesweighted dynamic dictionariesweighted leaf AVL-tree

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Recommendations

• Weighted Treewidth Algorithmic Techniques and Results
• Weighted minimal binary trees
• AVL trees with relaxed balance
• Power balance and apportionment algorithms for the United States Congress
• A new weight balanced binary search tree
• Weighted Binary Trees for Concurrent Searching
• A note on weighted rooted trees
• Publication:4735205
• Optimal weight allocation in rooted trees
• Approximate search strategies for weighted trees

Cited in

(3)

• Numerical database system based on a weighted search tree
• Implicit data structures for weighted elements
• Height-analysis of k-dimensional leaf and node height-balanced trees: A new approach

This page was built for publication: Weighted Leaf AVL-Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801089)