Problem

Find the length of the longest consecutive sequence path in a binary tree (parent to child direction only).

Given the root of a binary tree, find the length of the longest consecutive sequence path. A consecutive sequence path is one where each node's value is exactly one more than its parent (e.g., 1→2→3). The path goes from parent to child (root to leaf direction).