Practice Maximum Difference Between Node and Ancestor
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Medium#1026
LeetCode ProblemMaximum Difference Between Node and Ancestor
Problem Statement
Given the root of a binary tree, find the maximum value v for which there exist different nodes a and b where v = |a.val - b.val| and a is an ancestor of b. A node a is an ancestor of b if either: any child of a is equal to b or any child of a is an ancestor of b.
Source: Maximum Difference Between Node and Ancestor on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
root = [8,3,10,1,6,null,14,null,null,4,7,13]
Output
7
# Example 2
Input
root = [1,null,2,null,0,3]
Output
3
Constraints
The number of nodes in the tree is in the range [2, 5000].
0 <= Node.val <= 10^5
Related LeetCode Problems
Practice more problems similar to Maximum Difference Between Node and Ancestor.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.