-
Notifications
You must be signed in to change notification settings - Fork 8k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #318 from Shyam-2001/master
added diameter of binary tree
- Loading branch information
Showing
2 changed files
with
102 additions
and
2 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
99 changes: 99 additions & 0 deletions
99
Program's_Contributed_By_Contributors/C++_Programs/Diameter of binary tree.cpp
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,99 @@ | ||
| // Recursive optimized C program to find the diameter of a | ||
| // Binary Tree | ||
| #include <bits/stdc++.h> | ||
| using namespace std; | ||
|
|
||
| // A binary tree node has data, pointer to left child | ||
| // and a pointer to right child | ||
| struct node { | ||
| int data; | ||
| struct node *left, *right; | ||
| }; | ||
|
|
||
| // function to create a new node of tree and returns pointer | ||
| struct node* newNode(int data); | ||
|
|
||
| // returns max of two integers | ||
| int max(int a, int b) { return (a > b) ? a : b; } | ||
|
|
||
| // function to Compute height of a tree. | ||
| int height(struct node* node); | ||
|
|
||
| // Function to get diameter of a binary tree | ||
| int diameter(struct node* tree) | ||
| { | ||
| // base case where tree is empty | ||
| if (tree == NULL) | ||
| return 0; | ||
|
|
||
| // get the height of left and right sub-trees | ||
| int lheight = height(tree->left); | ||
| int rheight = height(tree->right); | ||
|
|
||
| // get the diameter of left and right sub-trees | ||
| int ldiameter = diameter(tree->left); | ||
| int rdiameter = diameter(tree->right); | ||
|
|
||
| // Return max of following three | ||
| // 1) Diameter of left subtree | ||
| // 2) Diameter of right subtree | ||
| // 3) Height of left subtree + height of right subtree + 1 | ||
| return max(lheight + rheight + 1, | ||
| max(ldiameter, rdiameter)); | ||
| } | ||
|
|
||
| // UTILITY FUNCTIONS TO TEST diameter() FUNCTION | ||
|
|
||
| // The function Compute the "height" of a tree. Height is | ||
| // the number f nodes along the longest path from the root | ||
| // node down to the farthest leaf node. | ||
| int height(struct node* node) | ||
| { | ||
| // base case tree is empty | ||
| if (node == NULL) | ||
| return 0; | ||
|
|
||
| // If tree is not empty then height = 1 + max of left | ||
| // height and right heights | ||
| return 1 + max(height(node->left), height(node->right)); | ||
| } | ||
|
|
||
| // Helper function that allocates a new node with the | ||
| // given data and NULL left and right pointers. | ||
| struct node* newNode(int data) | ||
| { | ||
| struct node* node | ||
| = (struct node*)malloc(sizeof(struct node)); | ||
| node->data = data; | ||
| node->left = NULL; | ||
| node->right = NULL; | ||
|
|
||
| return (node); | ||
| } | ||
|
|
||
| // Driver Code | ||
| int main() | ||
| { | ||
|
|
||
| /* Constructed binary tree is | ||
| 1 | ||
| / \ | ||
| 2 3 | ||
| / \ | ||
| 4 5 | ||
| */ | ||
| struct node* root = newNode(1); | ||
| root->left = newNode(2); | ||
| root->right = newNode(3); | ||
| root->left->left = newNode(4); | ||
| root->left->right = newNode(5); | ||
|
|
||
| // Function Call | ||
| cout << "Diameter of the given binary tree is " << | ||
| diameter(root); | ||
|
|
||
| return 0; | ||
| } | ||
|
|
||
| // This code is contributed by shivanisinghss2110 | ||
|
|