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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1026. Maximum Difference Between Node and Ancestor

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact