Leetcode Problem 298. Binary Tree Longest Consecutive Sequence

298. Binary Tree Longest Consecutive Sequence

Leetcode Solutions

Initialize a global variable maxLength to 0.
Define a recursive function dfs that takes a node p, its parent node parent, and the current length of the consecutive sequence.
If the current node p is null, return immediately.
If the current node p is consecutive with its parent (i.e., p.val == parent.val + 1), increment length; otherwise, reset length to 1.
Update maxLength with the maximum of its current value and length.
Recursively call dfs for the left and right children of p, passing the current node as the parent and the updated length.
After the traversal, return maxLength as the result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen