Problem
翻转二叉树
Example
输入:
4
/ \
2 7
/ \ / \
1 3 6 9
输出:
4
/ \
7 2
/ \ / \
9 6 3 1
Solution
递归的交换左右子树
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
if (root != null) {
TreeNode newLeft = invertTree(root.left);
TreeNode newRight = invertTree(root.right);
root.left = newRight;
root.right = newLeft;
return root;
}
return null;
}
}