
简单的递归就能实现
public TreeNode invertTree(TreeNode root) {
fn(root);
return root;
}
private static void fn(TreeNode node) {
if (node == null) {
return;
}
TreeNode t = node.left;
node.left = node.right;
node.right = t;
fn(node.left);
fn(node.right);
}
参考


