从零开始的LC刷题(27): Minimum Depth of Binary Tree 二叉树最小深度_the minimum depth of a complete binary tree with 6-CSDN博客

本文链接：https://blog.csdn.net/cyr429/article/details/90480767

原题：

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,null,15,7],
    3
   / \
  9  20
    /  \
   15   7
return its minimum depth = 2.

这道题没什么好说的，读题理解，后序遍历，结果：

Success

Runtime: 4 ms, faster than 99.96% of C++ online submissions for Minimum Depth of Binary Tree.

Memory Usage: 19.5 MB, less than 80.00% of C++ online submissions for Minimum Depth of Binary Tree.

代码：

/**
 * 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==NULL){return 0;}
        if (root->left==NULL&&root->right==NULL){return 1;}
        else if(root->left==NULL){return minDepth(root->right)+1;}
        else if(root->right==NULL){return minDepth(root->left)+1;}
        int l=minDepth(root->left)+1;
        int r=minDepth(root->right)+1;
        if(l<=r){return l;}
        else return r;
    }
};