298. Binary Tree Longest Consecutive Sequence

[LeetCode] 298. Binary Tree Longest Consecutive Sequence

298. Binary Tree Longest Consecutive Sequence Medium Given the root of a binary tree, return the length of the longest consecutive sequence path. A consecutive sequence path is a path where the values increase by one along the path. Note that the path can start at any node in the tree, and you cannot go from a node to its parent in the path. Example 1: Input: root = [1,null,3,2,4,null,null,null,..