* Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

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 see it time and again in Google interviews or new-grad hires: The way data structures and algorithms — among the most important subjects in a proper computer science curriculum — are learnt is often ...