Create 102. Binary Tree Level Order Traversal

Medo3-coder · web-flow · commit c78222d49f9f · 2022-10-30T22:51:08.000+02:00
diff --git a/Tree/102. Binary Tree Level Order Traversal b/Tree/102. Binary Tree Level Order Traversal
@@ -0,0 +1,28 @@
+class Solution {
+public:
+    vector<vector<int>> levelOrder(TreeNode* root) {
+        
+        vector<vector<int>> res ;
+        if(root == NULL){
+            return res ;
+        }
+        
+        queue<TreeNode*>q;
+        q.push(root);
+        while(!q.empty())
+        {
+            int size = q.size();
+            vector<int> level ;
+            for(int i = 0 ; i < size ; i++)
+            {
+                TreeNode* temp = q.front();
+                q.pop();
+                if(temp->left != NULL) q.push(temp->left);
+                if(temp->right!= NULL) q.push(temp->right);
+                level.push_back(temp->val);
+            }
+            res.push_back(level);
+        }
+        return res ;
+    }
+};
