LeetCode-226-翻转二叉树

LeetCode-226-翻转二叉树

思路

翻转就完了

代码

    public TreeNode invertTree(TreeNode root) {
        if(root==null)return root;
        TreeNode L=invertTree(root.left);
        TreeNode R=invertTree(root.right);
        root.right=L;
        root.left=R;
        return root;
    }