github/diameter_of_the_binary_tree.cpp at main · Pallavi960/github · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include<iostream>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;


struct Node{
    int data;
    Node* left;
    Node* right;
    Node(int val)//constructor
    {
        data=val;
        left=right=NULL;
    }
};

int height(Node* root,int *maxi)
{
    if(root==NULL)return 0;

    int lefthight=height(root->left,maxi);
    int righthight=height(root->right,maxi);
    *maxi=max(*maxi,lefthight+righthight);

    return 1+max(lefthight,righthight);
}


int main()
{
    Node* root=new Node(1);//

    root->left=new Node(2);
    root->left->right=new Node(3);
    root->left->left=new Node(4);

    root->right=new Node(5);
    root->right->left=new Node(6);
    root->right->right=new Node(7);
    int maxi=0;
   int ans=height(root,&maxi);
    cout<<"diameter of the binary tree:"<<maxi;


    return 0;
}
/*
         1
        / \
       2   5
      / \ / \
     4  3 6  7


*/