Binary Tree Longest Consecutive Sequence II

Given the root of a binary tree, return the length of the longest consecutive path in the tree. A consecutive path is a path where the values of adjacent nodes differ by one. This path can be either increasing or decreasing. For example, [1,2,3,4] and [4,3,2,1] are both valid consecutive paths, but [1,2,4,3] is not. The path can also follow the child-parent-child direction and does not need to stay in a single parent-to-child direction.