MidPoint_LL.cpp

#include<iostream>
#include "Node1.cpp"
using namespace std;

int length(Node1 *head)
{
    if(head==NULL)
    {
        return 0;
    }
    int len=length(head->next);
    return len+1;
}

int  MidPoint(Node1 *slow,Node1 *fast)
{
    if(fast->next==NULL)
    {
        return slow->a;
    }
    if(fast->next->next==NULL)
    {
        return slow->next->a;
    }
    return MidPoint(slow->next,fast->next->next);
}
Node1* takeInput(){
    int dt;
    cin>>dt;
    if(dt==-1){
        return NULL;
    }
    Node1 *head=NULL,*tail=NULL;
    Node1 *newnode=new Node1(dt);
    if(head==NULL ){
        head=newnode;
        tail=newnode;
    }
    Node1 *temp=head;
    cin>>dt;
    while(dt!=-1){
        Node1 *newnode=new Node1(dt);
        tail->next=newnode;
        tail=newnode;
        cin>>dt;
    }
    return head;
}

void print(Node1 *head)
{
    if(head==NULL)
    {
        cout<<"\nSorry no Linked List....\n";
        return;
    }
    while(head!=NULL)
    {
        cout<<head->a<<" ";
        head=head->next;
    }
    cout<<endl;
}

int main()
{
    Node1 *ptr=takeInput();
    print(ptr);
    cout<<MidPoint(ptr,ptr->next)<<endl;
    return 0;
}