【二叉树的递归】02二叉树的最大深度【Maximum Depth of Binary Tree】

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

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

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

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

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest 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
 
#include <iostream>
#include <cstdio>
#include <stack>
#include <vector>
#include <queue>
#include  "BinaryTree.h"

using  namespace std;

int maxDepth(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)
        {
            que.push(tmp->left);
        }
         if(tmp->right !=  NULL)
        {
            que.push(tmp->right);
        }
         if(count ==  0)
        {
            depth ++;
            count = que.size();
        }
    }
     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 << maxDepth(pNodeA1) << endl;


    DestroyTree(pNodeA1);
     return  0;
}
结果输出:
4
 
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);
    }
}


 

转载于:https://www.cnblogs.com/codemylife/p/3652380.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值