Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Appearance settings

Expand file tree

/

Solution103.hpp

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
39 lines (35 loc) · 916 Bytes
/

Solution103.hpp

File metadata and controls

39 lines (35 loc) · 916 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
//
// Solution103.hpp
// Algorithm
//
// Created by Pancf on 2020/11/15.
// Copyright © 2020 Pancf. All rights reserved.
//
#ifndef Solution103_hpp
#define Solution103_hpp
#include <stdio.h>
#include <vector>
/// Definition for a binary tree node.
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};
class Solution103 {
public:
std::vector<std::vector<int>> zigzagLevelOrder(TreeNode* root);
static void test()
{
TreeNode n1{15};
TreeNode n2{7};
TreeNode n3{9};
TreeNode n4{20, &n1, &n2};
TreeNode n5{3, &n3, &n4};
Solution103 s;
auto res = s.zigzagLevelOrder(&n5);
}
};
#endif /* Solution103_hpp */
Morty Proxy This is a proxified and sanitized view of the page, visit original site.