Minimum Depth of Binary Tree Java

Spencer_Lin

于 2014-07-31 15:59:44 发布

阅读量360

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode BinaryTree+BSF+DFS

本文链接：https://blog.csdn.net/linxiang0591/article/details/38318829

LeetCode BinaryTree+BSF+DFS 专栏收录该内容

16 篇文章

订阅专栏

本文深入探讨了如何使用深度优先搜索（DFS）和广度优先搜索（BFS）解决二叉树最小深度问题。详细解释了递归和迭代两种方法，并提供了具体的Java代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

 /*
    Solution1:
    key to solve: DFS, recursion
    1.Classic DFS recursion
     */
    public int minDepthDFS(TreeNode root) {
        //base case
        if (root == null) return 0;

        //recursion
        int left = minDepthDFS(root.left);
        int right = minDepthDFS(root.right);

        if (left == 0) return left+1;
        if (right == 0) return right+1;

        return Math.min(left, right) + 1;
    }
    /*
    Solution2: BFS ArrayList
    Key to solve: BFS, ArrayList similar with Maximum Depth
    1. the initial depth value start from 1;
    2. Go through Tree by level => BFS
     */
    private int minDepthBFS(TreeNode root){
        if(root==null) return 0;
        List<TreeNode> treeList=new ArrayList<TreeNode>();

        //start from 1
        int depth=1;
        treeList.add(root);

        while(!treeList.isEmpty()){
            List<TreeNode> cur=new ArrayList<TreeNode>();
            for(TreeNode t:treeList) {
                if (t.left == null && t.right == null) return depth;
                if (t.left != null) cur.add(t.left);
                if (t.right != null) cur.add(t.right);
            }
            //clone the current level to TreeList
            treeList=new ArrayList<TreeNode>(cur);
            depth++;
        }
        return depth;
    }