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.

这道题就是求最短路径的节点数，同样用DFS遍历的方法来做，代码如下：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
void dfs(TreeNode*root, vector<int> & paths_num,int nn){
     if(root->left == NULL && root->right == NULL){
         paths_num.push_back(nn);
         return;
     };
     if(root->left != NULL) dfs(root->left, paths_num, nn+1);
     if(root->right != NULL) dfs(root->right, paths_num, nn+1);
 }

class Solution {
public:
    int minDepth(TreeNode* root) {
        vector<int>paths_num;
        int nn;
        if(root == NULL) return 0;
        nn = 1;
        dfs(root, paths_num,nn);
        sort(paths_num.begin(),paths_num.end());
        return paths_num[0];
    }
};