We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 41e83ec + 6dc5620 commit a290023Copy full SHA for a290023
2018.12.06-leetcode103/zjukk.md
@@ -0,0 +1,18 @@
1
+```
2
+class Solution {
3
+public:
4
+ vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
5
+ vector<vector<int>> res;
6
+ bfs(res,root,0,true);
7
+ return res;
8
+ }
9
+ void bfs(vector<vector<int>>& res, TreeNode* root, int level, bool fromLeft) {
10
+ if (!root) return;
11
+ if (level == res.size()) res.push_back({});
12
+ if (fromLeft) res[level].push_back(root->val);
13
+ else res[level].insert(res[level].begin(),root->val);
14
+ bfs(res,root->left,level+1,!fromLeft);
15
+ bfs(res,root->right,level+1,!fromLeft);
16
17
+};
18
0 commit comments