diameter of a binary tree

8.cpp

// diameter of binary tree
// consider a root --> diameter of a tree = max(if path goes through that root, if path does not go through that root)
// so diamter = max(lh+rh+1, max(ld,rd));

int diameter(node *t){
  if(t != NULL){
    int lh = height(t -> left);
    int rh = height(t -> right);
    
    int ld = diameter(t -> left);
    int rd = diameter(t -> right);
    return max(lh+rh+1, max(ld, rd));
  }
}