Middle_Element_Linkedlist

// A Function Program

/* Link list Node 
struct Node {
    int data;
    Node* next;
}; */
/* Should return data of middle node. If linked list is empty, then  -1*/
int getMiddle(Node *head)
{
  Node *fast,*slow;
  fast=head;
  slow=head;
  while((fast!=NULL)&&(fast->next!=NULL))
  {
      slow=slow->next;
      fast=fast->next->next;
  }
 return slow->data;
}