翻转二叉树
翻转一棵二叉树。
解法:二叉树的前序遍历
class Solution {
public TreeNode invertTree(TreeNode root) {
if(root == null) return null;
//交换左右节点
TreeNode temp = root.left;
root.left = root.right;
root.right = temp;
invertTree(root.left);
invertTree(root.right);
return root;
}
}