Given the root of a binary tree, return the length of the longest consecutive sequence path.
A consecutive sequence path is a path where each node value increases by
Constraints:
The number of nodes in the tree is in the range
Node.val
Given the root of a binary tree, return the length of the longest consecutive sequence path.
A consecutive sequence path is a path where each node value increases by
Constraints:
The number of nodes in the tree is in the range
Node.val