Implementation of the 'best fit' heuristic algorithm for bin packing problems. Incudes an implementation of 'binary tree with duplicates'. See this blog post for details: http://fwaris.wordpress.com/2013/04/01/best-fit-bin-packing/ Update: Bug fixes and added 'worst fit' heuristic implementation
5 people like thisPosted: 6 years ago by Faisal Waris
This sample show how to use seq-yield syntax to convert a binary tree to a sequence of elements.
3 people like thisPosted: 2 years ago by Dmitry Soshnikov
Solution to the layout binary tree problem from 99 OCaml problems
3 people like thisPosted: 6 years ago by Darren Platt, Tomas Petricek