Minimum Depth of Binary Tree

二叉树最小深度

joannae_hu

于 2014-07-25 21:15:22 发布

阅读量316

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode 递归

本文链接：https://blog.youkuaiyun.com/joannae_hu/article/details/38128533

LeetCode 专栏收录该内容

157 篇文章

订阅专栏

本文介绍了一种使用深度优先搜索(DFS)算法来查找二叉树最短路径的方法。通过递归地遍历左子树和右子树，直到到达叶子节点，可以找到从根节点到最近叶子节点的最短路径。

-----QUESTION-----

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.

-----SOLUTION-----

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
    int minDepth(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(!root) return 0;
  
        min_depth = INT_MAX;
        dfs(root,1);
        return min_depth;
        
    }
    void dfs(TreeNode* node, int depth){
        if(node->left)
        {
            dfs(node->left,depth+1);
        }
       
        if(node->right)
        {           
            dfs(node->right,depth+1);
        }
        
        if(!node->left && !node->right)
        {
            if(depth < min_depth)
            {
                min_depth = depth;
            }        
        }
    }
private:
    int min_depth;
};