Create main.cpp

Author: JawadSher

17 - Binary Tree Data Structure Problems/03 - Maximum Depth of Binary Tree/main.cpp

@@ -0,0 +1,36 @@
+/**
+ * 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 Solution {
+public:
+    int maxDepth(TreeNode* root) {
+        if(root == NULL) return 0;
+
+        queue<TreeNode*> q;
+        q.push(root);
+        int depth = 0;
+
+        while(!q.empty()){
+            int levelSize = q.size();
+            depth++;
+
+            for(int i = 0; i < levelSize; i++){
+                TreeNode* temp = q.front();
+                q.pop();
+
+                if(temp -> left) q.push(temp -> left);
+                if(temp -> right) q.push(temp -> right);
+            }
+        }
+
+        return depth;
+    }
+};