颠倒二叉树的节点,即对于每个节点来说,左子树都大于其,右子树都小于其。
思路比较顺利,就是递归的对其左右子节点都执行颠倒操作,之后交换器左右节点即可。
/**
* 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.right = invertTree(root.right);
root.left = invertTree(root.left);
TreeNode temp = root.right;
root.right = root.left;
root.left = temp;
return root;
}
}