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

给定一个二叉树，返回他的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. php序列化与反序列化
			
    php序列化简单来说就是 把复杂的数据类型压缩到一个字符串中php对象转换成字符串,反序列化就是把变量转换成对象 一般来说  当把这些序列化的数据放在URL中在页面之间会传递时,需要对这些数据调用ur ...
    
			
    2. 
						
  2. 写出完美的snprintf
			
    平时公司的代码安全扫描会给出不安全代码的告警,其中会检查代码中间的strcpy和sprintf函数,而要求使用strncpy和snprintf.今天我们讨论一下怎样写出完美的snprintf. snp ...
    
			
    3. 
						
  3. elasticsearch从入门到出门-01windows上安装使用
			
    elasticsearch 1.安装JDK,至少1.8.0_73以上版本,java -version2.下载和解压缩Elasticsearch安装包,目录结构3.启动Elasticsearch:bin ...
    
			
    4. 
						
  4. iOS  OC和JS的交互 javaScriptCore方法封装
			
    一.javaScriptCore javaScriptCore是一种JavaScript引擎,主要为webKit提供脚本处理能力,javaScriptCore是开源webkit的一部分,他提供了强大的 ...
    
			
    5. 
						
  5. 洛谷 2679 [NOIP 2015] 子串
			
    题目戳这里 一句话题意 给你两个字符串A,B从A中取出K个不重合子串(顺序与在A中顺序相同)组成B,问有多少种方案? Solution 话说重打还是出各种错误也是醉了 先看题目,因为答案与A串,B串和 ...
    
			
    6. 
						
  6. java访问微信接口发送消息
			
    最近在开发activiti流程的时候有个需求:流程到达每个审批节点后,需要向该节点的审批人发送一个消息,提示有审批需要处理. 参考了一下微信的开发者文档和网络上的一些技术博客,现在记录一下.以便后续继 ...
    
			
    7. 
						
  7. (转)ubuntu 12.04搭建Adobe Flash Media Server服务
			
    破解版传送门:http://fms45.cuplayer.com/fms4download.html 福利:1462-5247-1705-7678-8379-5590 下载解压 cd进目录,./ins ...
    
			
    8. 
						
  8. 解决编译caffe2遇到的坑
			
    首先我们要从源码克隆caffe2的库: git clone --recursive https://github.com/caffe2/caffe2.git 执行下载过程会报这样的错: Cloning ...
    
			
    9. 
						
  9. android客户端登录&注册的实现
			
    MainActivity多线程的实现: package com.example.loginconnect; import java.lang.ref.WeakReference; import jav ...
    
			
    10. 
						
  10. Ubuntu下，grep的用法
			
    grep(Global search Regular Expression and Print out the line)是一种强大的文本搜索工具,它能使用正则表达式搜索文本,并把匹配的行打印出来.U ...
    
			
    11.