Height from Level-Order Input

A binary tree is given in level order with -1 for a missing child (children of missing nodes are not listed). Print its height as the number of levels.

1 <= n <= 10^5