FUNCTIONAL PEARL On building trees with minimum height

DOI10.1017/S0956796897002803MaRDI QIDQ4360128zbMATH OpenOpenAlexFDO

Authors Richard S. Bird

Publication date 7 January 1998

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0956796897002803

zbMATH Keywords

binary treecost function

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Building Optimal Binary Search Trees from Sorted Values in O(N) Time
• Minimax trees in linear time with applications
• Height Restricted Optimal Binary Trees
• Minimax Trees in Linear Time with Applications

Cited in

(6)

• A few logs suffice to build (almost) all trees. II
• scientific article; zbMATH DE number 3954287 (Why is no real title available?)
• Three algorithms on Braun trees
• FUNCTIONAL PEARL
• An optimal, purely functional implementation of the Garsia-Wachs algorithm
• How to fit a tree in a box

This page was built for publication: FUNCTIONAL PEARL On building trees with minimum height

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