title: Find tree height given preorder
body: <p>Given a preorder traversal of a full binary tree, where each node is labeled either a leaf node or an internal node, is there a good algorithm to find the height of the tree?  For example, if N represents an internal node and L represents a leaf, then given the preorder traverseal NLNNLLL, the height would be three.</p>