[LeetCode] Minimum Depth of Binary Tree 二叉树的最小深度

今天药忘吃喽~ 2022-02-01 09:33 211阅读 0赞

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.

二叉树的经典问题之最小深度问题就是就最短路径的节点个数，还是用深度优先搜索DFS来完成，万能的递归啊。。。请看代码：

/\*\*

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

求二叉树的最大深度可以参见我的博文：

[http://www.cnblogs.com/grandyang/p/4051348.html][http_www.cnblogs.com_grandyang_p_4051348.html]

本文转自博客园[Grandyang][]的博客，原文链接：[\[LeetCode\] Minimum Depth of Binary Tree 二叉树的最小深度][LeetCode_ Minimum Depth of Binary Tree]

，如需转载请自行联系原博主。

[http_www.cnblogs.com_grandyang_p_4051348.html]: http://www.cnblogs.com/grandyang/p/4051348.html
[Grandyang]: https://home.cnblogs.com/u/grandyang/
[LeetCode_ Minimum Depth of Binary Tree]: http://www.cnblogs.com/grandyang/p/4042168.html