Leetcode Problem 1026. Maximum Difference Between Node and Ancestor

1026. Maximum Difference Between Node and Ancestor

Leetcode Solutions

Initialize a global variable result to store the maximum difference found.
Define a recursive function helper(node, cur_max, cur_min) that:
- Takes the current node and the current path's maximum and minimum values as arguments.
- Updates result with the maximum of the current result and the differences node.val - cur_min and cur_max - node.val.
- Recursively calls itself for the left and right children of the current node, updating cur_max and cur_min accordingly.
Call helper(root, root.val, root.val) to start the recursion.
Return the value of result after the recursion completes.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen