Time: 18 ms (15.01%), Space: 18.8 MB (55.51%) - LeetHub

Author: ayushnagar123

104-maximum-depth-of-binary-tree/104-maximum-depth-of-binary-tree.cpp

@@ -0,0 +1,23 @@
+/**
+ * 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 h = 0;
+    int maxDepth(TreeNode* root) {
+        if(!root) {
+            h = 0;
+            return 0;
+        }
+        h = max(maxDepth(root->left), maxDepth(root->right))+1;
+        return h;
+    }
+};