226翻转二叉树

翻转二叉树

给你一棵二叉树的根节点 root ，翻转这棵二叉树，并返回其根节点。

JAVA:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode invertTree(TreeNode root) {

        if(root==null) return null;
        if(root.left==null&&root.right==null) return root;
        TreeNode p=root.left;
        TreeNode q=root.right;
        invertTree(p);
        invertTree(q);
        TreeNode newNode=root.left;
        root.left=root.right;
        root.right=newNode;
        return root;
    }
}