力扣面试150题-- 翻转二叉树

Day 41

题目描述

做法

/*** 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;}TreeNode left=invertTree(root.left);TreeNode right=invertTree(root.right);TreeNode x=left;root.left=right;root.right=left;return root;}
}