树--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.

class Solution {
public:
    int run(TreeNode *root) {
        //题目：寻找叶子节点最小层数
        //递归思想
        //如果是空数，则高度为0
        //如果左子树为空，则树的高度为右子树的高度+1
        //如果右子树为空，则树的高度为左子树的高度+1
        //左子树和右子树都不为空，则树的高度为左右子树中高度较小的值+1
        if(root == nullptr)
            return 0;
        else if(root->left == nullptr)
            return run(root->right) + 1;
        else if(root->right == nullptr)
            return run(root->left) + 1;
        return min(run(root->left), run(root->right)) + 1;
        /*
         control may reach end of non-void function
         函数到达结尾可能没有返回值
        */
    }
};