Skip to content

Diameter of Binary Tree #146

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
divy-ansh wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Diameter of Binary Tree #146

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 21 additions & 0 deletions Trees and Graphs/Diameter of Binary Tree.txt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
#include<bits/stdc++.h>
int height(Node *n)
{
if(n==NULL)
return 0;

return 1+max(height(n->left),height(n->right));
}
int diameter(Node* node) {
// Your code here
if(node==NULL)
return 0;

int lh=height(node->left);
int rh=height(node->right);

int ld=diameter(node->left);
int rd=diameter(node->right);

return max(1+lh+rh,max(ld,rd));
}