题目链接:110. 平衡二叉树 - 力扣(LeetCode)
个人思路:平衡二叉树是求高度,求高度使用后序遍历
代码:
class Solution {
public boolean isBalanced(TreeNode root) {
return getHeight(root) != -1;
}
public int getHeight(TreeNode root){
if(root == null) return 0;
int leftHeight = getHeight(root.left);
if(leftHeight == -1){return -1;}
int rightHeight = getHeight(root.right);
if(rightHeight == -1){
return -1;
}
if(Math.abs(leftHeight-rightHeight)>1){return -1;}
return Math.max(leftHeight,rightHeight)+1;
}
}
题目链接:257. 二叉树的所有路径 - 力扣(LeetCode)
个人思路:这道题用到回溯,回溯目前看来就是删除叶子节点,回到上一层
代码:
/**
* 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 List<String> binaryTreePaths(TreeNode root) {
List<String> res = new ArrayList<>();
if(root==null){
return res;
}
List<Integer> paths = new ArrayList<>();
traversal(root,paths,res);
return res;
}
public void traversal(TreeNode root,List<Integer> paths,List<String> res){
paths.add(root.val);
if(root.left==null&&root.right==null){
StringBuilder sb = new StringBuilder();
for(int i = 0 ; i< paths.size()-1;i++){
sb.append(paths.get(i)).append("->");
System.out.println(sb);
}
sb.append(paths.get(paths.size()-1));
System.out.println(sb);
res.add(sb.toString());
return;
}
if(root.left!=null){
traversal(root.left,paths,res);
paths.remove(paths.size()-1);
}
if(root.right!=null){
traversal(root.right,paths,res);
paths.remove(paths.size()-1);
}
}
}
题目链接:404. 左叶子之和 - 力扣(LeetCode)
个人思路:其实关键的一点就是两行代码,一个是确定左子树的左叶子,另一个是右子树的左叶子,把这两个相加就是了
代码:
class Solution {
public int sumOfLeftLeaves(TreeNode root) {
if(root == null){
return 0;
}
int leftValue = sumOfLeftLeaves(root.left);
if(root.left!=null&&root.left.left==null&&root.left.right==null){
leftValue = root.left.val;
}
int rightValue = sumOfLeftLeaves(root.right);
int sum = leftValue+rightValue;
return sum;
}
}