LintCode Binary Tree Longest Consecution Sequence

Binary Tree Longest Consecutive Sequence
这道题目在leetcode上是带锁的题目，只能在lintcode上面去做
description：
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).

Have you met this question in a real interview? Yes
Example
For example,

 1
 \
  3
 / \
2   4
    \
     5

Longest consecutive sequence path is 3-4-5, so return 3.

  2
   \
    3
   / 
  2    
 / 
 1

Longest consecutive sequence path is 2-3,not3-2-1, so return 2

本题目应该使用 traversal 和 divide conquer的方式进行处理

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    /**
     * @param root the root of binary tree
     * @return the length of the longest consecutive sequence path
     */
    int longest = 0;
    public int longestConsecutive(TreeNode root) {
        // Write your code here
        util(root);
        return longest;
    }
    private int util(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int left = util(root.left);
        int right = util(root.right);
        int longx = 1;
        if (root.left != null && root.val + 1== root.left.val) {
            longx = Math.max(longx, left + 1);
        }
        if (root.right != null && root.val + 1 == root.right.val) {
            longx = Math.max(longx, right + 1);
        }
        if (longx > longest) {
            longest = longx;
        }
        return longx;
    }
}