Minimal-Cost Brother Trees

DOI10.1137/0213015MaRDI QIDQ3330523zbMATH OpenOpenAlexFDO

Authors

Publication date 1984

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

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

zbMATH Keywords

balanced treeBrother treescomparison-costcost measuresdata structuresdictionariesleaf-search treeslinear time algorithmsnode-visit costoptimal costspace-cost

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4049071
• The node visit cost of brother trees
• scientific article; zbMATH DE number 3845066
• scientific article; zbMATH DE number 4062615
• Balance in AVL trees and space cost of brother trees

Cited in

(10)

• The node visit cost of brother trees
• Balance in AVL trees and space cost of brother trees
• scientific article; zbMATH DE number 3845066 (Why is no real title available?)
• Purely Functional 1-2 Brother Trees
• Height-balanced trees of order (β, γ, δ)
• scientific article; zbMATH DE number 3954287 (Why is no real title available?)
• scientific article; zbMATH DE number 4049071 (Why is no real title available?)
• scientific article; zbMATH DE number 4062615 (Why is no real title available?)
• Supernode Binary Search Trees
• A tight upper bound for the path length of AVL trees

This page was built for publication: Minimal-Cost Brother Trees

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