Minimum Depth of Binary Tree - LeetCode

最新推荐文章于 2019-05-01 11:56:25 发布

原创最新推荐文章于 2019-05-01 11:56:25 发布 · 537 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #leetcode

C++ 同时被 2 个专栏收录

52 篇文章

订阅专栏

C++小程序练习

24 篇文章

订阅专栏

本文介绍了一种寻找二叉树最小深度的算法实现。通过递归遍历方式，计算从根节点到最近叶子节点的最短路径长度。适用于计算机科学与数据结构学习。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:

    int AllNode(TreeNode *node,int pathnum,int min)
    {
	    pathnum = pathnum + 1;
	    if(node->left == NULL && node->right == NULL)
	    {
	    	if (min == 1)
	    	{
		    	min = pathnum;
		    }
		    if (pathnum < min)
		    {
		    	return pathnum;
		    }
		    else
			return min;
	    }   
	
	    if (node->left != NULL)
	    {
    		min = AllNode(node->left, pathnum, min);
    	}
    	if(node->right != NULL)
	    {
	    	int x = AllNode(node->right,pathnum, min);
	    	if (min == 1)
	    	{
	    		min = x;
	    	}
	    	else
	    		min = min<x?min:x;
		
	    }
    	return min;
    }

    int minDepth(TreeNode *root)
    {
	    if (root == NULL)
	    {
	    	return 0;
    	}
    	else
        	return AllNode(root,0,1);
    }
};