cousins-in-binary-tree-ii

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given the <code>root</code> of a binary tree, replace the value of each node in the tree with the sum of all its cousins&#39; values.

Two nodes of a binary tree are cousins if they have the same depth with different parents.

Return the <code>root</code> of the modified tree.

Note that the depth of a node is the number of edges in the path from the root node to it.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2023/01/11/example11.png" style="width: 571px; height: 151px;" />
<pre>
Input: root = [5,4,9,1,10,null,7]
Output: [0,0,0,7,7,null,11]
Explanation: The diagram above shows the initial binary tree and the binary tree after changing the value of each node.
- Node with value 5 does not have any cousins so its sum is 0.
- Node with value 4 does not have any cousins so its sum is 0.
- Node with value 9 does not have any cousins so its sum is 0.
- Node with value 1 has a cousin with value 7 so its sum is 7.
- Node with value 10 has a cousin with value 7 so its sum is 7.
- Node with value 7 has cousins with values 1 and 10 so its sum is 11.
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2023/01/11/diagram33.png" style="width: 481px; height: 91px;" />
<pre>
Input: root = [3,1,2]
Output: [0,0,0]
Explanation: The diagram above shows the initial binary tree and the binary tree after changing the value of each node.
- Node with value 3 does not have any cousins so its sum is 0.
- Node with value 1 does not have any cousins so its sum is 0.
- Node with value 2 does not have any cousins so its sum is 0.
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree is in the range <code>[1, 105]</code>.</li>
	<li><code>1 &lt;= Node.val &lt;= 104</code></li>
</ul>

replaceValueInTree

Cousins in Binary Tree II

Cousins in Binary Tree

cousins-in-binary-tree

二叉树的堂兄弟节点

Maximum Level Sum of a Binary Tree

maximum-level-sum-of-a-binary-tree

最大层内元素和

Tree

Depth-First Search

Breadth-First Search

Hash Table

Binary Tree

给你一棵二叉树的根&nbsp;<code>root</code>&nbsp;，请你将每个节点的值替换成该节点的所有 堂兄弟节点值的和&nbsp;。

如果两个节点在树中有相同的深度且它们的父节点不同，那么它们互为 堂兄弟&nbsp;。

请你返回修改值之后，树的根&nbsp;<code>root</code>&nbsp;。

注意，一个节点的深度指的是从树根节点到这个节点经过的边数。

&nbsp;

示例 1：

<img alt="" src="https://assets.leetcode.com/uploads/2023/01/11/example11.png" style="width: 571px; height: 151px;" />

<pre>
输入：root = [5,4,9,1,10,null,7]
输出：[0,0,0,7,7,null,11]
解释：上图展示了初始的二叉树和修改每个节点的值之后的二叉树。
- 值为 5 的节点没有堂兄弟，所以值修改为 0 。
- 值为 4 的节点没有堂兄弟，所以值修改为 0 。
- 值为 9 的节点没有堂兄弟，所以值修改为 0 。
- 值为 1 的节点有一个堂兄弟，值为 7 ，所以值修改为 7 。
- 值为 10 的节点有一个堂兄弟，值为 7 ，所以值修改为 7 。
- 值为 7 的节点有两个堂兄弟，值分别为 1 和 10 ，所以值修改为 11 。
</pre>

示例 2：

<img alt="" src="https://assets.leetcode.com/uploads/2023/01/11/diagram33.png" style="width: 481px; height: 91px;" />

<pre>
输入：root = [3,1,2]
输出：[0,0,0]
解释：上图展示了初始的二叉树和修改每个节点的值之后的二叉树。
- 值为 3 的节点没有堂兄弟，所以值修改为 0 。
- 值为 1 的节点没有堂兄弟，所以值修改为 0 。
- 值为 2 的节点没有堂兄弟，所以值修改为 0 。
</pre>

&nbsp;

提示：

<ul>
	<li>树中节点数目的范围是&nbsp;<code>[1, 105]</code> 。</li>
	<li><code>1 &lt;= Node.val &lt;= 104</code></li>
</ul>