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.

Subscribe to see which companies asked this question

分析

求根节点到叶结点的最小距离，和求树的最大深度是类似的。 见 leetcode-104-Maximum-Depth-of-Binary-Tree

解决方案1（C++）

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
/**
 * 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 minDepth(root->right) + 1;
        }
        if(root->right == NULL) {
            return minDepth(root->left) + 1;
        }
        return min(minDepth(root->left), minDepth(root->right)) + 1;
    }
};

相关问题

(E) Binary Tree Level Order Traversal
(E) Maximum Depth of Binary Tree

题目来源