Time: 9 ms (32.83%), Space: 18.9 MB (39.60%) - LeetHub

Ritik7Roshan · Ritik7Roshan · commit bbe0bfa7369e · 2023-09-10T18:21:44.000+05:30
diff --git a/0104-maximum-depth-of-binary-tree/0104-maximum-depth-of-binary-tree.cpp b/0104-maximum-depth-of-binary-tree/0104-maximum-depth-of-binary-tree.cpp
@@ -0,0 +1,24 @@
+/**
+ * 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;
+        int lh=maxDepth(root->left);
+        int rh= maxDepth(root->right);
+        
+        return 1+max(lh,rh);
+        
+    }
+};
