Leetcode 257. Binary Tree Paths

最新推荐文章于 2024-06-19 16:14:51 发布

北城路人

最新推荐文章于 2024-06-19 16:14:51 发布

阅读量37

点赞数

分类专栏：算法打卡文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/weixin_42542290/article/details/127813251

版权

算法打卡专栏收录该内容

55 篇文章 0 订阅

订阅专栏

题目链接：https://leetcode.cn/problems/binary-tree-paths/

方法一迭代

1 方法思想

2 代码实现

/**
 * 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> ans = new ArrayList<>();
        if (root == null) return ans;
        Stack<TreeNode> stack = new Stack<>();
        Stack<String> path = new Stack<>();
        stack.push(root);
        path.push(String.valueOf(root.val));

        while (!stack.isEmpty()) {
            TreeNode node = stack.pop();
            String pathTemp = path.pop();
            if (node.right == null && node.left == null) {
                ans.add(pathTemp);
            }
            if (node.right != null) {
                stack.push(node.right);
                path.add(String.valueOf(new StringBuffer(pathTemp).append("->").append(node.right.val)));
            }
            if (node.left != null) {
                stack.push(node.left);
                path.add(String.valueOf(new StringBuffer(pathTemp).append("->").append(node.left.val)));
            }
        }
        return ans;
    }
}

3 复杂度分析

时间复杂度：
空间复杂度：

4 涉及到知识点

方法二递归

1 方法思想

2 代码实现

/**
 * 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 {
    
     List<String> ans = new ArrayList<>();

    public List<String> binaryTreePaths(TreeNode root) {

        if (root == null) return ans;
        else {
            if (root.left != null) {
                getPath(root.left, String.valueOf(root.val));
            }
            if (root.right != null) {
                getPath(root.right, String.valueOf(root.val));
            }
            if (root.left == null && root.right == null)ans.add(String.valueOf(root.val));
        }
        return ans;
    }

    public void getPath(TreeNode node, String path) {

        String temPath = path + "->" + String.valueOf(node.val);
        if (node.left != null) {
            getPath(node.left, temPath);
        }
        if (node.right != null) {
            getPath(node.right, temPath);
        }
        if (node.left == null && node.right == null){
            ans.add(temPath);
        }
    }
}