title: Binary Tree Two Longesth Path's of Same Length
body: <p>In a binary tree, how do you determine which path is the longest if you have two paths of the same length that are longer than the rest of the other paths? Essentially, no single path is the longest...do you just pick one of the paths or is it first or last encountered path or something?</p>