find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree

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 two binary trees <code>original</code> and <code>cloned</code> and given a reference to a node <code>target</code> in the original tree.

The <code>cloned</code> tree is a copy of the <code>original</code> tree.

Return a reference to the same node in the <code>cloned</code> tree.

Note that you are not allowed to change any of the two trees or the <code>target</code> node and the answer must be a reference to a node in the <code>cloned</code> tree.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2020/02/21/e1.png" style="width: 544px; height: 426px;" />
<pre>
Input: tree = [7,4,3,null,null,6,19], target = 3
Output: 3
Explanation: In all examples the original and cloned trees are shown. The target node is a green node from the original tree. The answer is the yellow node from the cloned tree.
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2020/02/21/e2.png" style="width: 221px; height: 159px;" />
<pre>
Input: tree = [7], target = 7
Output: 7
</pre>

Example 3:
<img alt="" src="https://assets.leetcode.com/uploads/2020/02/21/e3.png" style="width: 459px; height: 486px;" />
<pre>
Input: tree = [8,null,6,null,5,null,4,null,3,null,2,null,1], target = 4
Output: 4
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the <code>tree</code> is in the range <code>[1, 104]</code>.</li>
	<li>The values of the nodes of the <code>tree</code> are unique.</li>
	<li><code>target</code> node is a node from the <code>original</code> tree and is not <code>null</code>.</li>
</ul>

&nbsp;
Follow up: Could you solve the problem if repeated values on the tree are allowed?

getTargetCopy

Find a Corresponding Node of a Binary Tree in a Clone of That Tree

Tree

Depth-First Search

Breadth-First Search

Binary Tree

给你两棵二叉树，原始树 <code>original</code> 和克隆树 <code>cloned</code>，以及一个位于原始树 <code>original</code>&nbsp;中的目标节点&nbsp;<code>target</code>。

其中，克隆树 <code>cloned</code>&nbsp;是原始树 <code>original</code>&nbsp;的一个 副本 。

请找出在树&nbsp;<code>cloned</code>&nbsp;中，与&nbsp;<code>target</code>&nbsp;相同&nbsp;的节点，并返回对该节点的引用（在 C/C++ 等有指针的语言中返回 节点指针，其他语言返回节点本身）。

&nbsp;

注意：你 不能 对两棵二叉树，以及 <code>target</code>&nbsp;节点进行更改。只能 返回对克隆树&nbsp;<code>cloned</code>&nbsp;中已有的节点的引用。

<ul>
</ul>

&nbsp;

<ul>
</ul>

示例 1:

<img alt="" src="https://assets.leetcode.com/uploads/2020/02/21/e1.png" />

<pre>
输入: tree = [7,4,3,null,null,6,19], target = 3
输出: 3
解释: 上图画出了树 original 和 cloned。target 节点在树 original 中，用绿色标记。答案是树 cloned 中的黄颜色的节点（其他示例类似）。</pre>

示例 2:

<img alt="" src="https://assets.leetcode.com/uploads/2020/02/21/e2.png" />

<pre>
输入: tree = [7], target = 7
输出: 7
</pre>

示例 3:

<img alt="" src="https://assets.leetcode.com/uploads/2020/02/21/e3.png" />

<pre>
输入: tree = [8,null,6,null,5,null,4,null,3,null,2,null,1], target = 4
输出: 4
</pre>

&nbsp;

提示：

<ul>
	<li>树中节点的数量范围为<meta charset="UTF-8" />&nbsp;<code>[1, 104]</code>&nbsp;。</li>
	<li>同一棵树中，没有值相同的节点。</li>
	<li><code>target</code>&nbsp;节点是树&nbsp;<code>original</code>&nbsp;中的一个节点，并且不会是&nbsp;<code>null</code>&nbsp;。</li>
</ul>

&nbsp;

进阶：如果树中允许出现值相同的节点，将如何解答？