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.

Implementation of an Algorithm for the Calculation of the Smallest Enclosing Circle and the Voronoi Diagram in O(nlogn) complexity using efficient structures such as Red-Black balanced binary search ...

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 ...

I am Java programmer, blogger on http://javarevisited.blogspot.com and http://java67.com In this article, I’ll share some frequently asked programming interview ...