Diameter of Binary Trees

Author: alisamad1

Trees/diameter_of_Binary_trees.cpp

@@ -0,0 +1,34 @@
+#include<iostream>
+using namespace std;
+struct Node{
+    int data;
+    Node* left;
+    Node* right;
+    Node(int val) : data(val), left(nullptr), right(nullptr) {}
+};
+int ans;
+int depth(Node * root){
+    if(root == NULL){
+        return 0;
+    }
+    int left = depth(root->left);
+    int right = depth(root->right);
+    ans = max(ans , left + right);
+    return max(left, right)  + 1;
+}
+int diamterofBinaryTree(Node * root){
+    ans = 0;
+    depth(root);
+    return ans;
+}
+int main(){
+    Node * root = new Node(1);
+    root->left = new Node(2);
+    root->right = new Node(3);
+    root->left->left = new Node(4);
+    root->left->right = new Node(5);
+    root->right->left = new Node(6);
+    root->right->right = new Node(7);
+    cout << "Diamter of the binary trees is : " << diamterofBinaryTree(root) << endl;
+    return 0; 
+}