就把vector改成用栈类存放层次遍历的一层的序列

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

给定一个二叉树，自底向上的返回他的层次遍历的节点的values。(提示，从左到右，一层一层的遍历，但是这里是从叶子节点到根节点)

例如：

给定一个二叉树 {3,9,20,#,#,15,7},

    3

   / \

  9  20

    /  \

   15   7

返回的层次遍历的结果是：

[

  [15,7]

  [9,20],

  [3],

]

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

Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).

For example:
Given binary tree {3,9,20,#,#,15,7},

    3

   / \

  9  20

    /  \

   15   7

return its bottom-up level order traversal as:

[

  [15,7]

  [9,20],

  [3],

]
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
  
#include <iostream>
#include <cstdio>
#include <stack>
#include <vector>
#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) {}
 * };
 */

vector<vector<int> > levelOrderBottom(TreeNode *root)
{

vector<vector<int> > matrix;
    if(root == NULL)
    {
        return matrix;
    }

stack<vector<int> > sv;
    vector<int> temp;
    temp.push_back(root->val);
    /*先把根结点的这一行信息放到栈中*/
    sv.push(temp);

vector<TreeNode *> path;
    path.push_back(root);

int count = 1;
    while(!path.empty())
    {
        if(path[0]->left != NULL)
        {
            path.push_back(path[0]->left);
        }
        if(path[0]->right != NULL)
        {
            path.push_back(path[0]->right);
        }
        path.erase(path.begin());
        count--;
        if(count == 0)
        {
            vector<int> tmp;
            vector<TreeNode *>::iterator it = path.begin();
            for(; it != path.end(); ++it)
            {
                tmp.push_back((*it)->val);
            }
            sv.push(tmp);
            count = path.size();
        }
    }
    /*遍历结果栈*/
    while(!sv.empty())
    {
        if(sv.top().size() > 0)
        {
            matrix.push_back(sv.top());
        }
        sv.pop();
    }
    return matrix;
}

// 树中结点含有分叉，
//                  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);

PrintTree(pNodeA1);

vector<vector<int> > ans = levelOrderBottom(pNodeA1);

for (int i = 0; i < ans.size(); ++i)
    {
        for (int j = 0; j < ans[i].size(); ++j)
        {
            cout << ans[i][j] << " ";
        }
    }
    cout << endl;

DestroyTree(pNodeA1);
    return 0;
}
输出结果：
4 7 9 2 6 1 8
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);
    }
}

 


												


											
【遍历二叉树】05二叉树的层次遍历II【Binary Tree Level Order Traversal II】的更多相关文章
	

    
						
  1. [Swift]LeetCode107. 二叉树的层次遍历 II | Binary Tree Level Order Traversal II
		
    Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left ...
    
		
    2. 
						
  2. 102/107. Binary Tree Level Order Traversal/II
		
    原文题目: 102. Binary Tree Level Order Traversal 107. Binary Tree Level Order Traversal II 读题: 102. 层序遍历 ...
    
		
    3. 
						
  3. 【LeetCode】107. Binary Tree Level Order Traversal II (2 solutions)
		
    Binary Tree Level Order Traversal II Given a binary tree, return the bottom-up level order traversal ...
    
		
    4. 
						
  4. 35. Binary Tree Level Order Traversal  &&  Binary Tree Level Order Traversal II
		
    Binary Tree Level Order Traversal OJ: https://oj.leetcode.com/problems/binary-tree-level-order-trave ...
    
		
    5. 
						
  5. Binary Tree Level Order Traversal,Binary Tree Level Order Traversal II
		
    Binary Tree Level Order Traversal Total Accepted: 79463 Total Submissions: 259292 Difficulty: Easy G ...
    
		
    6. 
						
  6. LeetCode之“树”：Binary Tree Level Order Traversal && Binary Tree Level Order Traversal II
		
    Binary Tree Level Order Traversal 题目链接 题目要求: Given a binary tree, return the level order traversal o ...
    
		
    7. 
						
  7. LeetCode_107. Binary Tree Level Order Traversal II
		
    107. Binary Tree Level Order Traversal II Easy Given a binary tree, return the bottom-up level order ...
    
		
    8. 
						
  8. 63. Binary Tree Level Order Traversal II
		
    Binary Tree Level Order Traversal II My Submissions QuestionEditorial Solution Total Accepted: 79742 ...
    
		
    9. 
						
  9. [Leetcode] Binary tree level order traversal ii二叉树层次遍历
		
    Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left ...
    
		
    10. 
						
  10. [LeetCode] Binary Tree Level Order Traversal II 二叉树层序遍历之二
		
    Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left ...
    
		
    11. 
		

	


随机推荐
	

    
									
  1. 不依任何赖第三方，单纯用vue实现Tree 树形控件
			
    这几天接到一个需求,里面有需要做一个属性组件,找的第三方的,但是不能完全满足我的需求,有这时间,我就自己做个小轮子吧. 先看效果图(红点之前用的字体图标,是个对号,这里为了方便,用圆圈代替了选中状态, ...
    
			
    2. 
						
  2. 【BZOJ4930】棋盘 拆边费用流
			
    [BZOJ4930]棋盘 Description 给定一个n×n的棋盘,棋盘上每个位置要么为空要么为障碍.定义棋盘上两个位置(x,y),(u,v)能互相攻击当前仅 当满足以下两个条件: 1:x=u或y ...
    
			
    3. 
						
  3. NSTheard 详解
			
    一.什么是NSThread NSThread是基于线程使用,轻量级的多线程编程方法(相对GCD和NSOperation),一个NSThread对象代表一个线程, 需要手动管理线程的生命周期,处理线程同 ...
    
			
    4. 
						
  4. HDU - 1598 find the most comfortable road  【最小生成树】
			
    题目链接 http://acm.hdu.edu.cn/showproblem.php?pid=1598 思路 用kruskal 算法 将边排序后 跑 kruskal 然后依次将最小边删除 再去跑 kr ...
    
			
    5. 
						
  5. 分布式数据库对比评测（Es,mongodb,redis）基础知识篇
			
    前言 我建议大家看下这个,否则后面你不知道我在说什么. 1.ES数据库相关概念 啥是Es,说白了就是支持文档搜索的分布式数据库,专门方便搜索的,GITHUB京东现在都在用. 1.ES的数据库存放在哪里 ...
    
			
    6. 
						
  6. Python 可变长度函数参数
			
    func( *tuple_grp_nonkw_args, **dict_grp_kw_args ) 在编程的过程中,我们可能会遇到函数参数个数不固定的情况.这时就需要使用可变长度的函数参数来实现我们的 ...
    
			
    7. 
						
  7. Mysql 导入实战
			
    这个几天公司迁移预览版数据库,当前公司使用的是 Mysql 数据库,版本为 5.6.迁移的数据库大小也不算很大,2G 多一点,总体以小表为主,就几张表数据比较大,有业务记录表达到了 150W 的数量级 ...
    
			
    8. 
						
  8. [原创] hadoop学习笔记：wordcout程序实践
			
    看了官网上的示例:但是给的不是很清楚,这里依托官网给出的示例,加上自己的实践,解析worcount程序的操作 1.首先你的确定你的集群正确安装,并且启动你的集群,应为这个是hadoop2.6.0,所以 ...
    
			
    9. 
						
  9. web框架详解之tornado 二 cookie
			
    一.tornado之cookie一 目录: <!DOCTYPE html> <html lang="en"> <head> <meta c ...
    
			
    10. 
						
  10. day4 内置函数 迭代器&生成器 yield总结  三元运算 闭包
			
    内置函数: 内置函数 # abs()返回一个数字的绝对值.如果给出复数,返回值就是该复数的模. b = -100 print(b) print(abs(b)) # all() 所有为真才为真,只要有一 ...
    
			
    11.