题目:翻转一棵二叉树。
例如:
输入:
4
/
2 7
/ \ /
1 3 6 9
输出:
4
/
7 2
/ \ /
9 6 3 1
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;
}
TreeNode p=invertTree(root.left);
TreeNode q=invertTree(root.right);
root.left=q;
root.right=p;
return root;
}
}