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

给定一个二叉树，返回他的Z字形层次遍历的节点的values。(提示，从左到右，然后下一层从右到左，然后再变化方向，就是这样一层一层的遍历)

例如：

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

    3

   / \

  9  20

    /  \

   15   7

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

[

  [3],

  [20,9],

  [15,7]

]

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

Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).

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

    3

   / \

  9  20

    /  \

   15   7

return its zigzag level order traversal as:

[

  [3],

  [20,9],

  [15,7]

]
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
  
#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> > zigzagLevelOrder(TreeNode *root)
{
    vector<vector<int> > matrix;
    if(root == NULL)
    {
        return matrix;
    }

vector<int> temp;
    temp.push_back(root->val);
    matrix.push_back(temp);

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

int count = 1;
    /*拨动开关-因为第二次是从右边到左边*/
    bool lefttoright = false;

while(!path.empty())
    {
        TreeNode *tp = path.front();
        if(tp->left != NULL)
        {
            path.push_back(tp->left);
        }
        if(tp->right != NULL)
        {
            path.push_back(tp->right);
        }

path.erase(path.begin());
        count--;

if(count == 0 && path.size())
        {
            vector<int> tmp;
            tmp.clear();
            if(lefttoright)
            {
                /*从左到右*/
                vector<TreeNode *>::iterator it = path.begin();
                for(; it != path.end(); ++it)
                {
                    tmp.push_back( (*it)->val );
                }
                lefttoright = false;
            }
            else
            {
                /*从右到左-下面这段代码VS运行错误不知道为什么*/
                //vector<TreeNode *>::iterator it = path.end();
                //for(--it; it >= path.begin(); --it)
                //{
                //    tmp.push_back( (*it)->val );
                //}
                for (int i = path.size() - 1; i >= 0; --i)
                {
                    tmp.push_back( path[i]->val );
                }

lefttoright = true;
            }
            matrix.push_back(tmp);
            count = path.size();
        }
    }
    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 = zigzagLevelOrder(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;
}

 
输出结果：
题目ac了，但是测试用例没有通过




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);
    }
}














												


											
【遍历二叉树】06二叉树曲折(Z字形)层次遍历II【Binary Tree Zigzag Level Order Traversal】的更多相关文章
	

    
						
  1. LeetCode 103. 二叉树的锯齿形层次遍历(Binary Tree Zigzag Level Order Traversal)
		
    103. 二叉树的锯齿形层次遍历 103. Binary Tree Zigzag Level Order Traversal 题目描述 给定一个二叉树,返回其节点值的锯齿形层次遍历.(即先从左往右,再 ...
    
		
    2. 
						
  2. 剑指offer从上往下打印二叉树 、leetcode102. Binary Tree Level Order Traversal(即剑指把二叉树打印成多行、层序打印）、107. Binary Tree Level Order Traversal II 、103. Binary Tree Zigzag Level Order Traversal(剑指之字型打印)
		
    从上往下打印二叉树这个是不分行的,用一个队列就可以实现 class Solution { public: vector<int> PrintFromTopToBottom(TreeNode ...
    
		
    3. 
						
  3. [LeetCode] Binary Tree Level Order Traversal 与 Binary Tree Zigzag Level Order Traversal，两种按层次遍历树的方式，分别两个队列，两个栈实现
		
    Binary Tree Level Order Traversal Given a binary tree, return the level order traversal of its nodes ...
    
		
    4. 
								
  4. [Leetcode] Binary tree Zigzag level order traversal二叉树Z形层次遍历
		
    Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to ...
    
		
    5. 
						
  5. [LeetCode] Binary Tree Zigzag Level Order Traversal  二叉树的之字形层序遍历
		
    Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to ...
    
		
    6. 
						
  6. [Swift]LeetCode103. 二叉树的锯齿形层次遍历 | Binary Tree Zigzag Level Order Traversal
		
    Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to ...
    
		
    7. 
						
  7. 二叉树的锯齿形层次遍历 · Binary Tree Zigzag Level Order Traversal
		
    ［抄题］: 给出一棵二叉树,返回其节点值的锯齿形层次遍历(先从左往右,下一层再从右往左,层与层之间交替进行) ［思维问题］: 不知道反复切换要怎么做:用boolean normalOrder当作布尔型 ...
    
		
    8. 
						
  8. [LeetCode] 103. Binary Tree Zigzag Level Order Traversal  二叉树的之字形层序遍历
		
    Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to ...
    
		
    9. 
						
  9. leetCode 103.Binary Tree Zigzag Level Order Traversal （二叉树Z字形水平序） 解题思路和方法
		
    Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to ...
    
		
    10. 
		

	


随机推荐
	

    
									
  1. 【JavaEE】Springmvc搭建方法及example
			
    现在介绍SSH的文章很多,但是适合自己需求的却经常找不到,这些东西呢,会了之后总会感觉别人的程序哪里哪里别扭,会之前呢就感觉很混乱,而且SSH的官方文档,至少在我看来是“会者勉强能看.不会者一片迷茫” ...
    
			
    2. 
						
  2. Unity导出AssetBundle到指定路径
			
    using System.Collections; using UnityEngine; using UnityEditor; using System.IO; /// <summary> ...
    
			
    3. 
						
  3. php扩展安装phpize
			
    安装php(fastcgi模式)的时候,常常有这样一句命令:/usr/local/webserver/php/bin/phpize 一.phpize是干嘛的? phpize是什么东西呢?php官方的说 ...
    
			
    4. 
						
  4. Django模板系统(非常详细)（后台数据如何展示在前台）
			
    前面的章节我们看到如何在视图中返回HTML,但是HTML是硬编码在Python代码中的这会导致几个问题:1,显然,任何页面的改动会牵扯到Python代码的改动网站的设计改动会比Python代码改动更频 ...
    
			
    5. 
						
  5. map 玩家上线
			
    map 玩家上线 else if(gs2ms_add_player == pkt.cmd) { PlayerChannel* pPC = new PlayerChannel(this); //加到地图 ...
    
			
    6. 
						
  6. 通过eclipse.ini修改Eclipse加载jdk的路径
			
    这里直接把在网上的找到的答案记录下来,原文地址:http://www.oschina.net/question/109676_15561: 如果出现 启动 Eclipse 弹出“Failed to l ...
    
			
    7. 
						
  7. 【BZOJ5020】[THUWC 2017]在美妙的数学王国中畅游 泰勒展开+LCT
			
    [BZOJ5020][THUWC 2017]在美妙的数学王国中畅游 Description 数字和数学规律主宰着这个世界. 机器的运转, 生命的消长, 宇宙的进程, 这些神秘而又美妙的过程无不可以用数 ...
    
			
    8. 
						
  8. Amr and Chemistry
			
    C. Amr and Chemistry time limit per test 1 second memory limit per test 256 megabytes input standard ...
    
			
    9. 
						
  9. openssl将私钥和crt证书合成pfx证书
			
    pfx是什么文件:公钥加密技术12号标准(Public Key Cryptography Standards #12,PKCS#12)为存储和传输用户或服务器私钥.公钥和证书指定了一个可移植的格式.它 ...
    
			
    10. 
						
  10. unity里standard pbr(一）
			
    关注forwardbase下的 standard.shader #pragma vertex vertBase #pragma fragment fragBase #include "Uni ...
    
			
    11.