代码随想录之二叉树的所有路径

本题在力扣257

JAVA版本

解法一：递归 + 回溯
思路学习于代码随想录

class Solution {
    public List<String> binaryTreePaths(TreeNode root) {
         List<String> result = new ArrayList<>(); //作为最终的结果
         if(root == null) {
             return result;
         }

         List<Integer> paths = new ArrayList<>(); //作为中间的输出结果
         traversal(root, paths, result);
         return result;
    }
    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();// StringBuilder用来拼接字符串，速度更快
            for (int i = 0; i < paths.size() - 1; i++) {
                sb.append(paths.get(i)).append("->");
            }
            sb.append(paths.get(paths.size() - 1));// 记录最后一个节点
            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);// 回溯
        }
    }

}

解法二：层序遍历
学习与力扣的官方解题法

class Solution {
    public List<String> binaryTreePaths(TreeNode root) {
         List<String> paths = new ArrayList<>(); //作为最终的结果
        if (root == null) {
            return paths;
        }
        Queue<TreeNode> nodeQueue = new LinkedList<TreeNode>();  //存储结点
        Queue<String> pathQueue = new LinkedList<String>();     //存储路线

        nodeQueue.offer(root);
        pathQueue.offer(Integer.toString(root.val));

        while (!nodeQueue.isEmpty()) {
            TreeNode node = nodeQueue.poll(); 
            String path = pathQueue.poll();

            if (node.left == null && node.right == null) {
                paths.add(path);
            } else {
                if (node.left != null) {
                    nodeQueue.offer(node.left);
                    pathQueue.offer(new StringBuffer(path).append("->").append(node.left.val).toString());
                }

                if (node.right != null) {
                    nodeQueue.offer(node.right);
                    pathQueue.offer(new StringBuffer(path).append("->").append(node.right.val).toString());
                }
            }
        }
        return paths;
    }
}