Binary Tree Longest Consecutive Sequence II

Given the root of a binary tree, return the length of the longest consecutive path, where adjacent node values differ by one. The path may be increasing or decreasing and can pass through a node in the child-parent-child direction. Binary Tree Longest Consecutive Sequence II Given the root of a binary tree, return the length of the longest consecutive path, where adjacent node values differ by one. The path may be increasing or decreasing and can pass through a node in the child-parent-child direction. SWE tree dfs tree-traversal recursion medium Frequency Single report Last asked 2026-01-11 Stage onsite-coding 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. Examples Example 1: Input: root = [1,2,3] Output: 2 Explanation: The longest consecutive path is [1,2] or [2,1]. Example 2: Input: root = [2,1,3] Output: 3 Explanation: The longest consecutive path is [1,2,3] or [3,2,1]. Constraints 1 <= Number of nodes <= 3 * 10^4 -3 * 10^4 <= Node.val <= 3 * 10^4