Path Length of Binary Search Trees

DOI10.1137/0122024MaRDI QIDQ5650276zbMATH OpenOpenAlexFDO

Authors

Publication date 1972

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
• Optimal binary search trees
• Bounding the depth of search trees
• scientific article; zbMATH DE number 437543

Cited in

(20)

• Testing the optimality of alphabetic trees
• Monotonicity and efficient computation of optimal dichotomous search
• Operations research applications of dichotomous search
• Parallel construction of binary trees with near optimal weighted path length
• Least upper bound on the cost of optimum binary search trees
• scientific article; zbMATH DE number 4173001 (Why is no real title available?)
• Alphabetic Minimax Trees of Degree at Most t
• scientific article; zbMATH DE number 4031714 (Why is no real title available?)
• scientific article; zbMATH DE number 4031716 (Why is no real title available?)
• scientific article; zbMATH DE number 4062608 (Why is no real title available?)
• Optimality of right leaning trees
• Huffman trees and fibonacci numbers
• scientific article; zbMATH DE number 4096779 (Why is no real title available?)
• Ranking the Best Binary Trees
• Bounding the depth of search trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• A New Proof of the T-C Algorithm
• Optimal binary search trees
• A fast and space-economical algorithm for length-limited coding
• Old and new results on alphabetic codes

This page was built for publication: Path Length of Binary Search Trees

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