1102. Invert a Binary Tree (25)-PAT甲级真题

柳婼

已于 2023-11-09 18:19:56 修改

阅读量1.9k

点赞数 9

文章标签： PAT 算法

于 2016-08-10 20:04:01 首次发布

本文链接：https://blog.csdn.net/liuchuo/article/details/52175736

版权

The following is from Max Howell @twitter:
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.
Now it’s your turn to prove that YOU CAN invert a binary tree!

Input Specification:

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.