Tree Diameter — Longest Path Between Any Two Nodes

int diameter = 0;
int height(Node n) {
  if (n == null) return 0;
  int leftH = height(n.left);
  int rightH = height(n.right);
  diameter = max(diameter, leftH + rightH);
  return 1 + max(leftH, rightH);
}