Merge pull request #6982 from Tushar1323/main

Depth_of_Binarytree

Binary Tree/maxDepth.cpp

@@ -0,0 +1,29 @@
+#include <iostream>
+using namespace std;
+
+struct Node
+{
+    int data;
+    Node *left;
+    Node *right;
+    Node(int val)
+    {
+        data = val;
+        left = nullptr;
+        right = nullptr;
+    }
+};
+
+int maxDepth(Node *root)
+{
+    if(root==NULL)
+    return 0;
+
+    return max(maxDepth(root->left), maxDepth(root->right)) + 1;
+}
+
+int main()
+{
+
+    return 0;
+}

Binary Tree/minDepth.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+using namespace std;
+
+struct Node
+{
+    int data;
+    Node *left;
+    Node *right;
+    Node(int val)
+    {
+        data = val;
+        left = nullptr;
+        right = nullptr;
+    }
+};
+
+int minDepth(Node *root)
+{
+    if(root==NULL)
+    return 0;
+
+    if(root->left==NULL)
+    return minDepth(root->right) + 1;
+
+    if(root->right==NULL)
+    return minDepth(root->left) + 1;
+
+    return min(minDepth(root->left), minDepth(root->right)) + 1;
+}
+
+int main()
+{
+
+    return 0;
+}