Update Solution.cpp

Author: yanglbme

solution/0100-0199/0102.Binary Tree Level Order Traversal/Solution.cpp

@@ -1,3 +1,12 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
 class Solution {
 public:
     vector<vector<int>> levelOrder(TreeNode* root) {
@@ -7,7 +16,8 @@ class Solution {
         while (!q.empty()) {
             vector<int> oneLevel;
             for (int i = q.size(); i > 0; --i) {
-                TreeNode* t = q.front(); q.pop();
+                TreeNode* t = q.front();
+                q.pop();
                 oneLevel.push_back(t->val);
                 if (t->left) q.push(t->left);
                 if (t->right) q.push(t->right);
@@ -16,4 +26,4 @@ class Solution {
         }        
         return res;
     }
-};
+};