题目
翻转一棵二叉树。
示例
输入:
4
/ \
2 7
/ \ / \
1 3 6 9
输出:
4
/ \
7 2
/ \ / \
9 6 3 1
代码
/**
* 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){return null;}
if(root.left==null&&root.right==null){return root;}
TreeNode left=root.left;
TreeNode right=root.right;
root.left=right;
root.right=left;
invertTree(root.left);
invertTree(root.right);
return root;
}
}