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

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

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

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

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. Amr and Chemistry
			
    C. Amr and Chemistry time limit per test 1 second memory limit per test 256 megabytes input standard ...
    
			
    2. 
						
  2. netstat命令简单使用
			
    1.适用范围 该命令用于打印网络连接.路由表.接口统计.伪装连接.多播成员等信息. (netstat已经过时,现在使用ss命令,所以本文不会作过多翻译,只着重一些重要部分) 2.语法概览 netsta ...
    
			
    3. 
						
  3. STL中vector怎么实现邻接表
			
    最近,同期的一位大佬给我出了一道题目,改编自 洛谷 P2783 有机化学之神偶尔会做作弊 这道题好坑啊,普通链表过不了,只能用vector来存边.可能更快一些吧? 所以,我想记录并分享一下vector ...
    
			
    4. 
						
  4. Linux 下 Crontab 命令使用详解 定时任务
			
    一.  Crontab 介绍 crontab命令的功能是在一定的时间间隔调度一些命令的运行. 1.1 /etc/crontab 文件 在/etc文件夹下有一个crontab文件,这里存放有系统运行的一 ...
    
			
    5. 
						
  5. sql获取数组指定元素
			
    需求:获取字符数组1,2,3的第2个元素 方法:通过自定义函数来实现 /* 获取字符串数组某个元素 */ from sysobjects where id = object_id('Get_StrAr ...
    
			
    6. 
						
  6. shell基础part3
			
    shell基础 一.环境变量配置文件简介 1.source命令的作用就是将环境变量配置文件强制生效,其格式为: source 环境变量配置文件或者 . 环境变量配置文件 2.环境变量配置文件中主要是定 ...
    
			
    7. 
						
  7. Django模型系统——ORM校园管理系统代码
			
    1.models.py from django.db import models # Create your models here. class Class(models.Model): id =  ...
    
			
    8. 
						
  8. 小程序坑 redirectTo 计时器 setInterval clearInterval
			
    var time = 20: var timer = setInterval(function () { time = time - 1; that.setData({ CountDown: time ...
    
			
    9. 
						
  9. javascript常见的20个问题与解决方法
			
    <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/ ...
    
			
    10. 
						
  10. JAVA中最方便的Unicode转换方法
			
    在命令行界面用native2ascii工具  1.将汉字转为Unicode:  C:\Program   Files\Java\jdk1.5.0_04\bin>native2ascii  测试  ...
    
			
    11.