226.翻转二叉树
1、代码(递归)
/**
* 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) {
//前序遍历翻转
//从上往下遍历
return swapTree(root);
}
public TreeNode swapTree(TreeNode node){
if(node == null) return node;
TreeNode temp = node.left;
node.left = node.right;
node.right = temp;
swapTree(node.left);
swapTree(node.right);
return node;
}
}
2、分析
(1)二叉树如果要用递归遍历的话首先需要明确思路:使用的是什么顺序的遍历。
(2)本题中由于要返回根节点,所以参数和返回值都是root。
(3)递归的终止条件就是当节点为空时,函数向上返回。
(4)单层递归逻辑就是节点的交换。
101. 对称二叉树
1、代码(递归)
/**
* 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 boolean isSymmetric(TreeNode root) {
//后序遍历的思路
return compare(root.left,root.right);
}
public boolean compare(TreeNode left,TreeNode right){
if(left != null && right == null){
return false;
}
if(left == null && right != null){
return false;
}
if(left == null && right == null){
return true;
}
if(left.val != right.val){
return false;
}
boolean compareOutside = compare(left.left,right.right);
boolean compareInside = compare(left.right,right.left);
return compareOutside && compareInside;
}
}
2、分析
(1)本题判断二叉树是否对称,可以推出判断的是:**根节点的左子树和右子树是否可以相互翻转。**所以是左子树和右子树会收集是否对称的信息,向上一层返回,由此可以推知是后序遍历的思路。
(2)因为需要对比左子树和右子树是否可以相互翻转,所以函数的参数是左子树和右子树各自的根节点,返回值是布尔值。
(3)终止条件和单层逻辑是程序判断左子树和右子树空或非空并且数值是否相等的情况。这里先判断了空的情况,再去判断数值,可以有效地返回空指针异常。当判空的条件都判断完毕时,判断数值。若数值相等,则递归比较这两个节点的外侧和内测节点,最后往上递归返回布尔值。
222. 完全二叉树的节点个数
1、代码(迭代)
/**
* 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 int countNodes(TreeNode root) {
return bfs(root);
}
public int bfs(TreeNode node){
if(node == null) return 0;
Queue<TreeNode> que = new LinkedList<>();
List<Integer> list = new ArrayList<>();
que.offer(node);
while(!que.isEmpty()){
int size = que.size();
while(size-- > 0){
TreeNode temp = que.poll();
list.add(temp.val);
if(temp.left != null) que.offer(temp.left);
if(temp.right != null) que.offer(temp.right);
}
}
return list.size();
}
}