mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-26 07:18:56 +08:00
44 lines
2.7 KiB
HTML
44 lines
2.7 KiB
HTML
<p>You are given the <code>root</code> of a binary tree with <code>n</code> nodes, where each node is uniquely assigned a value from <code>1</code> to <code>n</code>. You are also given a sequence of <code>n</code> values <code>voyage</code>, which is the <strong>desired</strong> <a href="https://en.wikipedia.org/wiki/Tree_traversal#Pre-order" target="_blank"><strong>pre-order traversal</strong></a> of the binary tree.</p>
|
|
|
|
<p>Any node in the binary tree can be <strong>flipped</strong> by swapping its left and right subtrees. For example, flipping node 1 will have the following effect:</p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/15/fliptree.jpg" style="width: 400px; height: 187px;" />
|
|
<p>Flip the <strong>smallest</strong> number of nodes so that the <strong>pre-order traversal</strong> of the tree <strong>matches</strong> <code>voyage</code>.</p>
|
|
|
|
<p>Return <em>a list of the values of all <strong>flipped</strong> nodes. You may return the answer in <strong>any order</strong>. If it is <strong>impossible</strong> to flip the nodes in the tree to make the pre-order traversal match </em><code>voyage</code><em>, return the list </em><code>[-1]</code>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2019/01/02/1219-01.png" style="width: 150px; height: 205px;" />
|
|
<pre>
|
|
<strong>Input:</strong> root = [1,2], voyage = [2,1]
|
|
<strong>Output:</strong> [-1]
|
|
<strong>Explanation:</strong> It is impossible to flip the nodes such that the pre-order traversal matches voyage.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2019/01/02/1219-02.png" style="width: 150px; height: 142px;" />
|
|
<pre>
|
|
<strong>Input:</strong> root = [1,2,3], voyage = [1,3,2]
|
|
<strong>Output:</strong> [1]
|
|
<strong>Explanation:</strong> Flipping node 1 swaps nodes 2 and 3, so the pre-order traversal matches voyage.</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2019/01/02/1219-02.png" style="width: 150px; height: 142px;" />
|
|
<pre>
|
|
<strong>Input:</strong> root = [1,2,3], voyage = [1,2,3]
|
|
<strong>Output:</strong> []
|
|
<strong>Explanation:</strong> The tree's pre-order traversal already matches voyage, so no nodes need to be flipped.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li>The number of nodes in the tree is <code>n</code>.</li>
|
|
<li><code>n == voyage.length</code></li>
|
|
<li><code>1 <= n <= 100</code></li>
|
|
<li><code>1 <= Node.val, voyage[i] <= n</code></li>
|
|
<li>All the values in the tree are <strong>unique</strong>.</li>
|
|
<li>All the values in <code>voyage</code> are <strong>unique</strong>.</li>
|
|
</ul>
|