#Leetcode# 111. Minimum Depth of Binary Tree

发布时间：2020-12-14 04:27:43 所属栏目：大数据来源：网络整理

导读：https://leetcode.com/problems/minimum-depth-of-binary-tree/ ? 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. Note:?A leaf is a

https://leetcode.com/problems/minimum-depth-of-binary-tree/

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.

Note:?A leaf is a node with no children.

Example:

Given binary tree?[3,9,20,null,15,7],

    3
   /   9  20
    /     15   7

return its minimum?depth = 2.

代码：

/**
 * 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 minDepth(TreeNode* root) {
        if(!root)
            return 0;
        if(!root -> left)
            return 1 + minDepth(root -> right);
        else if(!root -> right)
            return 1 + minDepth(root -> left);
        else
            return 1 + min(minDepth(root -> left),minDepth(root -> right));
    }
};

　　Morning

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!