Given a <code>binary tree</code>, return the <code>length</code> on the <code>longest consecutive sequence path</code>. A <code>path</code> can <code>start</code> from <code>any</code> node and go from <code>top to bottom</code>
 
<code>Example 1</code>
<pre><code>Input: 1 
 / \ 
 3 2 

Output: 2
</code></pre>
<blockquote>
Explanation: <code>1</code> and <code>2</code>
</blockquote>
<code>Example 2</code>
<pre><code>Input: 1 
 \ 
 3 

Output: 1
</code></pre>
<blockquote>
Explanation: <code>1</code> or <code>3</code>
</blockquote>

94: Binary tree longest consecutive sequence