<span style="font-size:18px;">
</span>
<span style="font-size:18px;"> Definition for a binary tree node.
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
public class Solution {
public TreeNode invertTree(TreeNode root) {
if (root == null) {
return null;
}
root.left = invertTree(root.left);
root.right = invertTree(root.right);
TreeNode tmp = root.left;
root.left = root.right;
root.right = tmp;
return root;
}
}</span>
面试的时候可能会被问到翻转二叉树,其实考察的思想就是递归思想,在这里记录一下!