Ranking the Best Binary Trees

DOI10.1137/0218060MaRDI QIDQ3833632zbMATH OpenOpenAlexFDO

Authors Shoshana Anily, Refael Hassin

Publication date 1989

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

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

zbMATH Keywords

alphabetic and nonalphabetic treesbinary treesranking of solutions

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Extremal properties of ?-weighted binary trees
• Optimal binary trees with order constraints
• Alphabetic Minimax Trees
• scientific article; zbMATH DE number 437543
• Path Length of Binary Search Trees

Cited in

(8)

• Operations research applications of dichotomous search
• Optimal leaf ordering of complete binary trees
• scientific article; zbMATH DE number 3845369 (Why is no real title available?)
• The method for choosing the best r-multiple trees
• Enumerating, Ranking and Unranking Binary Trees
• Extremal properties of ?-weighted binary trees
• scientific article; zbMATH DE number 4122014 (Why is no real title available?)
• Old and new results on alphabetic codes

This page was built for publication: Ranking the Best Binary Trees

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