LeetCode——Minimum Depth of Binary Tree

pickless

于 2013-09-22 01:25:43 发布

阅读量418

点赞数

CC 4.0 BY-SA版权

分类专栏： Online Judge 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/pickless/article/details/11885363

Online Judge 专栏收录该内容

134 篇文章

订阅专栏

本文介绍如何解决寻找给定二叉树的最小深度问题，即找到从根节点到最近叶子节点的最短路径长度。

摘要生成于 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.

» Solve this problem

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
private:
    int depth;    
    
    void traversal(TreeNode *root, int d) {
        if (root->left == NULL && root->right == NULL) {
            depth = d < depth || depth == 0 ? d : depth;            
        }
        else {
            if (root->left != NULL) {
                traversal(root->left, d + 1);                
            }
            if (root->right != NULL) {
                traversal(root->right, d + 1);            
            }
        }
    }
    
public:
    int minDepth(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        depth = 0;
        if (root != NULL) {
            traversal(root, 1);    
        }
        return depth;
    }
};