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.
1 parent d884b40 commit c73d678Copy full SHA for c73d678
2018.12.05-leetcode102/Ostrichcrab.md
@@ -0,0 +1,33 @@
1
+```
2
+/**
3
+ * Definition for a binary tree node.
4
+ * struct TreeNode {
5
+ * int val;
6
+ * TreeNode *left;
7
+ * TreeNode *right;
8
+ * TreeNode(int x) : val(x), left(NULL), right(NULL) {}
9
+ * };
10
+ */
11
+class Solution {
12
+public:
13
+ vector<vector<int>> levelOrder(TreeNode* root) {
14
+ vector<vector<int>> result;
15
+ queue<TreeNode*> que;
16
+ if(root == nullptr) return result;
17
+ que.push(root);
18
+ while(!que.empty()){
19
+ int size = que.size();
20
+ vector<int> tmp;
21
+ for(int i = 0; i < size; i++){
22
+ TreeNode* t = que.front();
23
+ que.pop();
24
+ tmp.push_back(t->val);
25
+ if(t->left) que.push(t->left);
26
+ if(t->right) que.push(t->right);
27
+ }
28
+ result.push_back(tmp);
29
30
+ return result;
31
32
+};
33
0 commit comments