第一题:剑指 Offer 55 - I. 二叉树的深度
问题描述
思路
递归左右子数求深度;返回最大值;
代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
int count=0;
public int maxDepth(TreeNode root) {
if(root == null) return 0;
int left = maxDepth(root.left);
int right = maxDepth(root.right);
return Math.max(left,right)+1;
}
}
第二题:剑指 Offer 55 - II. 平衡二叉树
问题描述
思路
代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public boolean isBalanced(TreeNode root) {
if(root == null) return true;
if(!isBalanced(root.left) || !isBalanced(root.right)) return false;
if(Math.abs(calDepth(root.right)-calDepth(root.left)) <= 1) {
return isBalanced(root.left) && isBalanced(root.right);
}
return false;
}
int calDepth(TreeNode root){
if(root == null) return 0;
else
return Math.max(calDepth(root.left),calDepth(root.right)) +1;
}
}