Weiss, Data Structures and Algorithm Analysis in Java, Chapters 2-5, 6-6.4, 6.9, 7, 9-9.3, 9.5; class lecture notes; MapReduce paper.

Given a non-empty binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child ...

Rooted binary trees inferred from molecular sequence data provide information about the evolutionary history of populations and species. We introduce metrics on ranked tree shapes and ranked ...

Though the problems number from 1 to 99, there are some gaps and some additions marked with letters. There are actually only 88 problems. There is no nested list type in OCaml, so we need to define ...