LEETCODE--Minimum Depth of Binary Tree

原创于 2015-11-12 15:45:45 发布 · 262 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

137 篇文章

订阅专栏

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

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

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.

Subscribe to see which companies asked this question

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int minlevel = 0;
    int minDepth(TreeNode* root) {
        if(!root)
            return 0;
        if(!root->left && !root->right)
            return 1;
        int leftdepth = minDepth(root->left);
        int rightdepth = minDepth(root->right);
        if(leftdepth == 0)
            return rightdepth+1;
        if(rightdepth == 0)
            return leftdepth+1;
        return min(leftdepth,rightdepth)+1;
    }
};