Leetcode 1026. Maximum Difference Between Node and Ancestor

Given a binary tree, find the maximum absolute difference |a.val - b.val| over all pairs where a is an ancestor of b. This reduces to a tree traversal problem where you maximize the difference by tracking the running minimum and maximum values along each root-to-node path.