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; }标签:tmp,Binary,right,TreeNode,invertTree,Invert,Tree,226,root From: https://www.cnblogs.com/MarkLeeBYR/p/16930023.html