Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1026. Maximum Difference Between Node and Ancestor
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source