[LeetCode]111. Minimum Depth of Binary Tree

[LeetCode]111. Minimum Depth of Binary Tree

题目描述

思路

深搜，如果节点为空，返回0，如果节点一个子树为空，则返回非空子树的深度

代码

#include <iostream>
#include <algorithm>
using namespace std;

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;
        }
        int leftDepth = minDepth(root->left),
            rightDepth = minDepth(root->right);
        return 1 + (min(leftDepth, rightDepth) ? min(leftDepth, rightDepth) : max(leftDepth, rightDepth));
    }
};


int main() {
    TreeNode *root = new TreeNode(1);
    TreeNode *left = new TreeNode(1);
    TreeNode *right = new TreeNode(1);
    TreeNode *child = new TreeNode(1);
    TreeNode *child2 = new TreeNode(1);

    root->left = left;
    left->left = child;
    left->right = child2;
    root->right = right;

    Solution s;

    cout << s.minDepth(root) << endl;
    system("pause");
}