[LeetCode] 111.Minimum Depth of Binary Tree

[LeetCode] 111.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.

解题思路

题目是要找到一棵二叉树的最小深度，题目比较简单，使用一个简单的递归就能解决了，思路就是每有一层就加1，然后不断去找较小的那一边。具体见代码。

实验代码

/**
 * 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) return 1 + minDepth(root->right);
        if(root->right == NULL) return 1 + minDepth(root->left);
        return 1 + min(minDepth(root->left), minDepth(root->right));
    }
};