Class Solution
java.lang.Object
g1001_1100.s1026_maximum_difference_between_node_and_ancestor.Solution
1026 - Maximum Difference Between Node and Ancestor.<p>Medium</p>
<p>Given the <code>root</code> of a binary tree, find the maximum value <code>v</code> for which there exist <strong>different</strong> nodes <code>a</code> and <code>b</code> where <code>v = |a.val - b.val|</code> and <code>a</code> is an ancestor of <code>b</code>.</p>
<p>A node <code>a</code> is an ancestor of <code>b</code> if either: any child of <code>a</code> is equal to <code>b</code> or any child of <code>a</code> is an ancestor of <code>b</code>.</p>
<p><strong>Example 1:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2020/11/09/tmp-tree.jpg" alt="" /></p>
<p><strong>Input:</strong> root = [8,3,10,1,6,null,14,null,null,4,7,13]</p>
<p><strong>Output:</strong> 7</p>
<p><strong>Explanation:</strong> We have various ancestor-node differences, some of which are given below :</p>
<pre><code> |8 - 3| = 5
|3 - 7| = 4
|8 - 1| = 7
|10 - 13| = 3
</code></pre>
<p>Among all possible differences, the maximum value of 7 is obtained by |8 - 1| = 7.</p>
<p><strong>Example 2:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2020/11/09/tmp-tree-1.jpg" alt="" /></p>
<p><strong>Input:</strong> root = [1,null,2,null,0,3]</p>
<p><strong>Output:</strong> 3</p>
<p><strong>Constraints:</strong></p>
<ul>
<li>The number of nodes in the tree is in the range <code>[2, 5000]</code>.</li>
<li><code>0 <= Node.val <= 10<sup>5</sup></code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
maxAncestorDiff
-