Minimum Depth of Binary Tree

最新推荐文章于 2023-12-15 03:22:29 发布

转载最新推荐文章于 2023-12-15 03:22:29 发布 · 46 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/RazerLu/p/3536924.html

本文介绍了一种算法，用于查找二叉树的最小深度，即从根节点到最近叶子节点的最短路径上的节点数量。该算法通过递归方式遍历二叉树的左子树和右子树，返回最小的深度值。

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int minDepth(TreeNode root) {
        if(root == null) 
            return 0;
        
        if(root.left == null && root.right == null) 
            return 1;
        
        int leftDepth = minDepth(root.left);
        int rightDepth = minDepth(root.right);
        
        if(leftDepth == 0){
            return rightDepth + 1;
        }else if(rightDepth == 0){
            return leftDepth + 1;
        }else{
            return Math.min(leftDepth, rightDepth)+1;
        }
    }
}