第六章 二叉树part04

递归是真的恶心

257 二叉树所有路径

lass Solution {
    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));
                sb.append("->");
            }
            sb.append(paths.get(paths.size()-1));
            res.add(sb.toString());
        }
        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);
        }
    }
    public List<String> binaryTreePaths(TreeNode root) {
        LinkedList<String> res = new LinkedList<>();
        List<Integer> paths = new ArrayList<>();
        traversal(root,paths,res);
        return res;
        
    }
}

404、左叶子之和

迭代法
 

class Solution {
    public boolean isLeaf(TreeNode node){
        return (node!=null&&node.left==null&&node.right==null);
    }
    public int sumOfLeftLeaves(TreeNode root) {
        int sum = 0;
        Deque<TreeNode> stack = new ArrayDeque<>();
        stack.push(root);
        while(!stack.isEmpty()){
            TreeNode tempNode = stack.pop();
            if(isLeaf(tempNode.left)){
                sum += tempNode.left.val;

            }
            if(tempNode.right!=null)stack.push(tempNode.right);
            if(tempNode.left!=null) stack.push(tempNode.left);
           
        }
        return sum;

    }
}

递归法
 

/**
 * 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 sumOfLeftLeaves(TreeNode root) {
        if(root == null) return 0;
        int leftValue = sumOfLeftLeaves(root.left);
        int rightValue = sumOfLeftLeaves(root.right);

        int midValue = 0;
        if(root.left != null && root.left.left == null && root.left.right == null){
            midValue = root.left.val;
        }
        int sum = leftValue + rightValue + midValue;
        return sum;

    }
}