LeetCode-Algorithms-[Easy][树基础题]面试题27. 二叉树的镜像

面试题27. 二叉树的镜像

	public TreeNode mirrorTree(TreeNode root) {
		if (root == null) {
			return null;
		}
		TreeNode left = mirrorTree(root.left);
		TreeNode right = mirrorTree(root.right);
		TreeNode tempNode = left;
		root.left = right;
		root.right = tempNode;
		return root;
	}