GFG_Linked_List_Sagregate_Even_Odd.cpp

#include <iostream>
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
struct node{
    ll data;
    struct node *next;
};

struct node* insert_head(struct node* head, ll value)
{
    struct node* new_node=(struct node*)(malloc(sizeof(struct node)));
    new_node->data=value;
    new_node->next=head;
    head=new_node;
    return head;
    
}
struct node* insert_tail(struct node* head,ll value)
{
    struct node* new_node=(struct node*)(malloc(sizeof(struct node)));
    new_node->data=value;
    new_node->next=NULL;
    struct node* temp_point=head;
    while(temp_point->next!=NULL)
        temp_point=temp_point->next;
    temp_point->next=new_node;
    return head;
    
}
void display(struct node* head)
{
    struct node* temp_head=head;
    cout<<"Linked List is "<<endl;
    while(temp_head!=NULL)
    {
        cout<<temp_head->data<<" ";
        temp_head=temp_head->next;
    }
    cout<<endl;
}
struct node* find(struct node* head,ll x)
{
    struct node* temp=head;
    if(temp->data==x)
        return temp;
    while(temp!=NULL)
    {
        if(temp->next->data==x)
            return temp;
        temp=temp->next;
    }
    return NULL;
}

void sagregate_even_odd(struct node* head)
{
    struct node* even=head;
    struct node* pointer=head;
    while(pointer!=NULL)
    {
        if((pointer->data)%2==0)
        {
            ll tempd=pointer->data;
            pointer->data=even->data;
            even->data=tempd;
            even=even->next;
            //cout<<"Swapping done"<<pointer->data<<endl;
        }
        pointer=pointer->next;
    }
}

int main() {
    
    struct node *head=NULL;
    head=insert_head(head,50);
    head=insert_head(head,67);
    head=insert_head(head,10);
    head=insert_tail(head,9);
    head=insert_tail(head,7);
    head=insert_tail(head,3);
    head=insert_tail(head,6);
    head=insert_tail(head,10);
    display(head);
    sagregate_even_odd(head);
    display(head);
}