[Leetcode] 298. Binary Tree Longest Consecutive Sequence

这一题比较简单的做法是DFS的bottom up。从上往下传递当前的连续长度和上一层的节点。如果上一层的节点是当前节点减一，那么上一层传下来的连续长度加一，否则连续长度重置为一。然后继续往左或者右传递。然后从当前值和左边返回的值和右边子树返回的值中取最大值返回。

    public int longestConsecutive(TreeNode root) {
        return this._DFSBottomUp(null, root, 0);
    }
    
    private int _DFSBottomUp(TreeNode prev, TreeNode current, int lastLvl) {
        if (current == null) {
            return lastLvl;
        } else {
            int currentLvl;
            if (prev == null || prev.val != current.val - 1) {
                currentLvl = 1;
            } else {
                currentLvl = lastLvl + 1;
            }
            
            return Math.max(currentLvl, Math.max(this._DFSBottomUp(current, current.left, currentLvl), this._DFSBottomUp(current, current.right, currentLvl)));
        }
    }