226、翻转二叉树
给你一棵二叉树的根节点 root ,翻转这棵二叉树,并返回其根节点。
示例 1:
输入:root = [4,2,7,1,3,6,9]
输出:[4,7,2,9,6,3,1]
示例 2:
输入:root = [2,1,3]
输出:[2,3,1]
示例 3:
输入:root = []
输出:[]
提示:
树中节点数目范围在 [0, 100] 内
-100 <= Node.val <= 100
方法一:递归
1.1 思路分析
通过递归调用,将只有叶子节点的父节点下的左右子节点交换,然后再向上层交换。
1.2 代码实现
/**
* 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 root;
invert(root);
return root;
}
public void invert(TreeNode node){
if (node == null) return;
TreeNode tmp = new TreeNode();
tmp = node.left;
node.left = node.right;
node.right = tmp;
invert(node.left);
invert(node.right);
}
}
1.3 测试结果
1.4 复杂度
- 时间复杂度:O(n)
- 空间复杂度:O(n)