Minimal-Cost Brother Trees

DOI10.1137/0213015zbMath0542.68048OpenAlexW1992641315MaRDI QIDQ3330523

No author found.

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

data structuresoptimal costlinear time algorithmsdictionariesbalanced treenode-visit costcost measuresBrother treescomparison-costleaf-search treesspace-cost

Mathematics Subject Classification ID

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

Related Items (3)

Balance in AVL trees and space cost of brother trees ⋮ The node visit cost of brother trees ⋮ A tight upper bound for the path length of AVL trees

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