++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

给定一个二叉树，找出他的最小的深度。

最小的深度，指的是从根节点到叶子节点的，经历的最小的节点个数。

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

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.

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
test.cpp：
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
  
#include <iostream>
#include <cstdio>
#include <stack>
#include <vector>
#include <queue>
#include "BinaryTree.h"

using namespace std;

int minDepth(TreeNode *root)
{

if(root == NULL)
    {
        return 0;
    }
    queue<TreeNode *> que;
    que.push(root);
    int count = 1;
    int depth = 0;
    while(!que.empty())
    {
        TreeNode *tmp = que.front();
        que.pop();
        count--;

if(tmp->left == NULL && tmp->right == NULL)
        {
            break;
        }

if(tmp->left != NULL)
        {
            que.push(tmp->left);
        }
        if(tmp->right != NULL)
        {
            que.push(tmp->right);
        }
        /*count等于0说明这一层遍历完了，可以depth做加一操作*/
        if(count == 0)
        {
            depth++;
            count = que.size();
        }
    }
    depth++;
    return depth;
}

// 树中结点含有分叉，
//                  8
//              /       \
//             6         1
//           /   \
//          9     2
//               / \
//              4   7
int main()
{
    TreeNode *pNodeA1 = CreateBinaryTreeNode(8);
    TreeNode *pNodeA2 = CreateBinaryTreeNode(6);
    TreeNode *pNodeA3 = CreateBinaryTreeNode(1);
    TreeNode *pNodeA4 = CreateBinaryTreeNode(9);
    TreeNode *pNodeA5 = CreateBinaryTreeNode(2);
    TreeNode *pNodeA6 = CreateBinaryTreeNode(4);
    TreeNode *pNodeA7 = CreateBinaryTreeNode(7);

ConnectTreeNodes(pNodeA1, pNodeA2, pNodeA3);
    ConnectTreeNodes(pNodeA2, pNodeA4, pNodeA5);
    ConnectTreeNodes(pNodeA5, pNodeA6, pNodeA7);

cout << minDepth(pNodeA1) << endl;

DestroyTree(pNodeA1);
    return 0;
}
结果输出：
2
 
BinaryTree.h:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
  
#ifndef _BINARY_TREE_H_
#define _BINARY_TREE_H_

struct TreeNode
{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

TreeNode *CreateBinaryTreeNode(int value);
void ConnectTreeNodes(TreeNode *pParent,
                      TreeNode *pLeft, TreeNode *pRight);
void PrintTreeNode(TreeNode *pNode);
void PrintTree(TreeNode *pRoot);
void DestroyTree(TreeNode *pRoot);

#endif /*_BINARY_TREE_H_*/
BinaryTree.cpp:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
  
#include <iostream>
#include <cstdio>
#include "BinaryTree.h"

using namespace std;

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

//创建结点
TreeNode *CreateBinaryTreeNode(int value)
{
    TreeNode *pNode = new TreeNode(value);

return pNode;
}

//连接结点
void ConnectTreeNodes(TreeNode *pParent, TreeNode *pLeft, TreeNode *pRight)
{
    if(pParent != NULL)
    {
        pParent->left = pLeft;
        pParent->right = pRight;
    }
}

//打印节点内容以及左右子结点内容
void PrintTreeNode(TreeNode *pNode)
{
    if(pNode != NULL)
    {
        printf("value of this node is: %d\n", pNode->val);

if(pNode->left != NULL)
            printf("value of its left child is: %d.\n", pNode->left->val);
        else
            printf("left child is null.\n");

if(pNode->right != NULL)
            printf("value of its right child is: %d.\n", pNode->right->val);
        else
            printf("right child is null.\n");
    }
    else
    {
        printf("this node is null.\n");
    }

printf("\n");
}

//前序遍历递归方法打印结点内容
void PrintTree(TreeNode *pRoot)
{
    PrintTreeNode(pRoot);

if(pRoot != NULL)
    {
        if(pRoot->left != NULL)
            PrintTree(pRoot->left);

if(pRoot->right != NULL)
            PrintTree(pRoot->right);
    }
}

void DestroyTree(TreeNode *pRoot)
{
    if(pRoot != NULL)
    {
        TreeNode *pLeft = pRoot->left;
        TreeNode *pRight = pRoot->right;

delete pRoot;
        pRoot = NULL;

DestroyTree(pLeft);
        DestroyTree(pRight);
    }
}

 






 


 


 




 
												


											
【二叉树的递归】01二叉树的最小深度【Minimum Depth of Binary Tree】的更多相关文章
	

    
						
  1. [LeetCode 111] - 二叉树的最小深度 (Minimum Depth of Binary Tree)
		
    问题 给出一棵二叉树,找出它的最小深度. 最小深度是指从根节点沿着最短路径下降到最近的叶子节点所经过的节点数. 初始思路 不难看出又是一个需要层次遍历二叉树的题目,只要在112基础上作出简单修改即可得 ...
    
		
    2. 
						
  2. [Swift]LeetCode111. 二叉树的最小深度 | Minimum Depth of Binary Tree
		
    Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shor ...
    
		
    3. 
						
  3. [LeetCode] 111. Minimum Depth of Binary Tree ☆(二叉树的最小深度)
		
    [Leetcode] Maximum and Minimum Depth of Binary Tree 二叉树的最小最大深度 (最小有3种解法) 描述 解析 递归深度优先搜索 当求最大深度时,我们只要 ...
    
		
    4. 
						
  4. 【LeetCode】Minimum Depth of Binary Tree   二叉树的最小深度 java
		
    [LeetCode]Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. The minimum dept ...
    
		
    5. 
						
  5. LeetCode OJ Minimum Depth of Binary Tree 递归求解
		
        题目URL:https://leetcode.com/problems/minimum-depth-of-binary-tree/ 111. Minimum Depth of Binary T ...
    
		
    6. 
						
  6. [LeetCode] Minimum Depth of Binary Tree 二叉树的最小深度
		
    Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shor ...
    
		
    7. 
						
  7. [LeetCode] 111. Minimum Depth of Binary Tree 二叉树的最小深度
		
    Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shor ...
    
		
    8. 
						
  8. (二叉树 BFS DFS) leetcode 111. Minimum Depth of Binary Tree
		
    Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shor ...
    
		
    9. 
						
  9. Minimum Depth of Binary Tree，求树的最小深度
		
    算法分析:递归和非递归两种方法. public class MinimumDepthofBinaryTree { //递归,树的最小深度,就是它左右子树的最小深度的最小值+1 public int m ...
    
		
    10. 
						
  10. Minimum Depth of Binary Tree最短深度
		
    Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shor ...
    
		
    11. 
		

	


随机推荐
	

    
									
  1. SDOI 2016 Round1 Day1
			
    储能表 /* 引自zyz大佬的数学思想 */ #include<cstdio> #include<iostream> using namespace std; typedef  ...
    
			
    2. 
						
  2. Just a Hook(线段树)
			
    Just a Hook Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total ...
    
			
    3. 
						
  3. 12.Django数据库操作（执行原生SQL）
			
    1.使用extra方法 解释:结果集修改器,一种提供额外查询参数的机制 说明:依赖model模型 用在where后: Book.objects.filter(publisher_id="1& ...
    
			
    4. 
						
  4. 第14条：尽量用异常来表示特殊情况，而不要返回Nono
			
    核心知识点: 1.用None这个返回值来表示特殊意义的函数,很容易使调用者犯错,因为None和0以及空字符串之类的值,在条件表达式里都会评估为False. 2.两种方法:二元法:将异常抛给上一级直接报 ...
    
			
    5. 
						
  5. Lean In - 读书笔记
			
    以下就是摘录了这本书中的相关内容. 他告诉我,想要“赢得每个人的喜欢”这种想法会阻碍我的发展.他说,当你想要让事情有所改变时,你不可能取悦每个人:而如果你去取悦每个人,你就不会获得充分的进步.扎克伯格 ...
    
			
    6. 
						
  6. 【LeetCode】【找元素】Find First and Last Position of Element in Sorted Array
			
    描述: Given an array of integers nums sorted in ascending order, find the starting and ending position ...
    
			
    7. 
						
  7. php线程pthread实践
			
    php有线程吗?----有,但是需要扩展pthreads,扩展方式网上有一堆的教程,这是只做线程demo. file_put_contents(dirname(__FILE__).'/1.txt',  ...
    
			
    8. 
						
  8. python 3 递归调用与二分法
			
    递归调用与二分法 1.递归调用 递归调用:在调用一个函数的过程中,直接或间接地调用了函数本身. 示例: def age(n): if n == 1: return 18 # 结束条件 return a ...
    
			
    9. 
						
  9. 让win10登陆时不再要求手动输入用户名
			
    如果windows每次登陆都要求手动输入用户名,可以用如下的方法避免: Windows10专业版.企业版和教育版用户 在运行或Cortana搜索栏输入secpol.msc后,按回车键进入"本 ...
    
			
    10. 
						
  10. nginx别名配置，状态配置，include优化
			
    一.nginx帮助参数 下面是关于/application/nginx/sbin/nginx 的参数帮助 [root@A conf]# /application/nginx/sbin/nginx -h ...
    
			
    11.