题目描述:
反转二叉树的左右子树。
实现:
public class Solution {
public TreeNode InvertTree(TreeNode root) {
if(root == null)
{
return null;
}
TreeNode tmp = root.left;
root.left = InvertTree(root.right);
root.right = InvertTree(tmp);
return root;
}
}