Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- class Node{
- public:
- int data;
- Node *left,*right;
- Node(int key){
- data=key;
- left=NULL;
- right=NULL;
- }
- };
- void preorder(Node *root){
- if(root==NULL)
- return;
- cout<<" "<<root->data;
- preorder(root->left);
- preorder(root->right);
- }
- int Height(Node *node_ptr,int &dia){
- if(node_ptr==NULL)
- return 0;
- int left_height= Height(node_ptr->left,dia);
- int right_height=Height(node_ptr->right,dia);
- dia=max(dia,left_height+right_height+1);
- return max(left_height,right_height)+1;
- }
- int DiameterOfTree(Node * root){
- if(root==NULL)
- return 0;
- int diameter=INT_MIN;
- Height(root,diameter);
- return diameter;
- }
- int main(){
- Node *root=NULL;
- Node *newnode=new Node(1);
- root=newnode;
- root->left=new Node(2);
- root->right=new Node(3);
- (root->left)->left=new Node(4);
- (root->right)->right=new Node(5);
- cout<<"pre order traversal ";
- preorder(root);
- cout<<endl<<DiameterOfTree(root);
- return 0;
- }
Add Comment
Please, Sign In to add comment