LeetCode-Minimum Depth of Binary Tree-CSDN博客

本文链接：https://blog.csdn.net/dancheren/article/details/53376212

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.

解题思路在代码注释中说明。

代码如下：

/**
 * 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) {
        /*
        minDepth(t)表示以t结点为根结点最小深度
    分情况讨论：
       1：如果t没有左右子结点，则返回1；
       2：如果t有左子结点没有右子结点，则返回minDepth(t->left)+1;
       3：如果t没有左子结点有右子结点，则返回minDepth(t->right)+1;
       4：如果左右子结点都存在，则返回左右子结点最小的深度，即返回 min(minDepth(t->left),minDepth(t->right))+1
           
        */
        if(root == NULL)return 0;
        if(root->left == NULL && root->right == NULL)return 1;
        if(root->left != NULL && root->right == NULL)return minDepth(root->left)+1;
        if(root->left == NULL && root->right != NULL)return minDepth(root->right)+1;
        return min(minDepth(root->left),minDepth(root->right))+1;

    }
};