Leetcode Problem 549. Binary Tree Longest Consecutive Sequence II

549. Binary Tree Longest Consecutive Sequence II

Leetcode Solutions

Define a helper function longestPath(TreeNode node) that returns an array [inr, dcr].
If the node is null, return [0, 0].
Recursively call longestPath for the left and right children of the current node.
If the left child's value is one less than the current node, update dcr as left_dcr + 1.
If the left child's value is one more than the current node, update inr as left_inr + 1.
Repeat steps 4 and 5 for the right child, taking the maximum values for inr and dcr.
Update the global maximum path length as max(maxval, inr + dcr - 1).
Return [inr, dcr] for the current node.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen