翻转二叉树
题目描述
给你一棵二叉树的根节点 root ,翻转这棵二叉树,并返回其根节点。
示例
原题OJ链接
https://leetcode.cn/problems/invert-binary-tree/
解答代码
/**
* 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) {
TreeNode cur = root;
if(cur == null){
return root;
}
if(cur.left == null && cur.right == null){
return cur;
}
TreeNode tmp = cur.right;
cur.right = cur.left;
cur.left = tmp;
invertTree(cur.left);
invertTree(cur.right);
return root;
}
}