mirror of
https://github.com/xlucn/PAT.git
synced 2026-10-30 00:37:37 +08:00
31 lines
1.3 KiB
HTML
31 lines
1.3 KiB
HTML
<!DOCTYPE html>
|
|
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
|
|
<h1>1102. Invert a Binary Tree (25)</h1>
|
|
<div id="problemContent">
|
|
<p>The following is from Max Howell @twitter:</p>
|
|
<p><i>Google: 90% of our engineers use the software you wrote (Homebrew), but you can't invert a binary tree on a whiteboard so fuck off.</i></p>
|
|
<p>Now it's your turn to prove that YOU CAN invert a binary tree!</p>
|
|
<p><b>
|
|
Input Specification:
|
|
</b></p>
|
|
<p>Each input file contains one test case. For each case, the first line gives a positive integer N (<=10) which is the total number of nodes in the tree -- and hence the nodes are numbered from 0 to N-1. Then N lines follow, each corresponds to a node from 0 to N-1, and gives the indices of the left and right children of the node. If the child does not exist, a "-" will be put at the position. Any pair of children are separated by a space.</p>
|
|
<p><b>
|
|
Output Specification:
|
|
</b></p>
|
|
<p>For each test case, print in the first line the level-order, and then in the second line the in-order traversal sequences of the inverted tree. There must be exactly one space between any adjacent numbers, and no extra space at the end of the line.</p>
|
|
<b>Sample Input:</b><pre>
|
|
8
|
|
1 -
|
|
- -
|
|
0 -
|
|
2 7
|
|
- -
|
|
- -
|
|
5 -
|
|
4 6
|
|
</pre>
|
|
<b>Sample Output:</b><pre>
|
|
3 7 2 6 4 0 5 1
|
|
6 5 7 4 3 2 0 1
|
|
</pre>
|
|
</div> |