text: /*
   * @lc app=leetcode id=298 lang=javascript
   *
   * [298] Binary Tree Longest Consecutive Sequence
   *
   * https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/description/
   *
   * algorithms
   * Medium (46.63%)
   * Likes:    499
   * Dislikes: 121
   * Total Accepted:    82.4K
   * Total Submissions: 175.9K
   * Testcase Example:  '[1,null,3,2,4,null,null,null,5]'
   *
   * Given a binary tree, find the length of the longest consecutive sequence
   * path.
   * 
   * The path refers to any sequence of nodes from some starting node to any node
   * in the tree along the parent-child connections. The longest consecutive path
   * need to be from parent to child (cannot be the reverse).
   * 
   * Example 1:
   * 
   * 
   * Input:
   * 
   * ⁠  1
   * ⁠   \
   * ⁠    3
   * ⁠   / \
   * ⁠  2   4
   * ⁠       \
   * ⁠        5
   * 
   * Output: 3
   * 
   * Explanation: Longest consecutive sequence path is 3-4-5, so return 3.
   * 
   * Example 2:
   * 
   * 
   * Input:
   * 
   * ⁠  2
   * ⁠   \
   * ⁠    3
   * ⁠   / 
   * ⁠  2    
   * ⁠ / 
   * ⁠1
   * 
   * Output: 2 
   * 
   * Explanation: Longest consecutive sequence path is 2-3, not 3-2-1, so return
   * 2.
   */
  
  // @lc code=start
  /**
   * Definition for a binary tree node.
   * function TreeNode(val, left, right) {
   *     this.val = (val===undefined ? 0 : val)
   *     this.left = (left===undefined ? null : left)
   *     this.right = (right===undefined ? null : right)
   * }
   */
  /**
   * @param {TreeNode} root
   * @return {number}
   */
  var longestConsecutive = function(root) {
      
  };
  // @lc code=end
  
  