A lightweight Java implementation of a binary search tree written from scratch—no Java collections used. Built as part of the Algorithms and Programming Models course to deepen understanding of tree ...

Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

An algorithm is given for constructing an alphabetic binary tree of minimum weighted path length (for short, an optimal alphabetic tree). The algorithm needs 4n 2 + 2n operations and 4n storage ...