#include <stdio.h>
#include <stdlib.h>
#include <iostream>
using namespace std;
struct Node
{
int data;
struct Node* next;
};
Node* Insert(Node* head, int data);
Node* print(Node* head);
void ReverseIterative();
Node* Insert(Node* head, int data)
{
Node* newNode = new Node();
newNode->data = data;
newNode->next = NULL;
if(head == NULL)
{
return newNode;
}
Node* curr=head;
while(curr->next!=NULL)
{
curr=curr->next;
}
curr->next = newNode;
return head;
}
Node* printList(Node* head)
{
while(head)
{
cout<<head->data;
head=head->next;
}
cout<<endl;
}
int main()
{
struct Node* head = NULL;
head = Insert(head, 2);
head = Insert(head, 4);
printList(head);
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdGRsaWIuaD4KI2luY2x1ZGUgPGlvc3RyZWFtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnN0cnVjdCBOb2RlCnsKICAgIGludCBkYXRhOwogICAgc3RydWN0IE5vZGUqIG5leHQ7Cn07CgpOb2RlKiBJbnNlcnQoTm9kZSogaGVhZCwgaW50IGRhdGEpOwpOb2RlKiBwcmludChOb2RlKiBoZWFkKTsKdm9pZCBSZXZlcnNlSXRlcmF0aXZlKCk7CgoKTm9kZSogSW5zZXJ0KE5vZGUqIGhlYWQsIGludCBkYXRhKQp7CiAgICBOb2RlKiBuZXdOb2RlID0gbmV3IE5vZGUoKTsKICAgIG5ld05vZGUtPmRhdGEgPSBkYXRhOwogICAgbmV3Tm9kZS0+bmV4dCA9IE5VTEw7CgogICAgaWYoaGVhZCA9PSBOVUxMKQogICAgewogICAgICAgIHJldHVybiBuZXdOb2RlOwogICAgfQoKICAgIE5vZGUqIGN1cnI9aGVhZDsKICAgIHdoaWxlKGN1cnItPm5leHQhPU5VTEwpCiAgICB7CiAgICAgICAgY3Vycj1jdXJyLT5uZXh0OwogICAgfQogICAgY3Vyci0+bmV4dCA9IG5ld05vZGU7CiAgICByZXR1cm4gaGVhZDsKfQoKTm9kZSogcHJpbnRMaXN0KE5vZGUqIGhlYWQpCnsKICAgIHdoaWxlKGhlYWQpCiAgICB7CiAgICAgICAgY291dDw8aGVhZC0+ZGF0YTsKICAgICAgICBoZWFkPWhlYWQtPm5leHQ7CiAgICB9CiAgICBjb3V0PDxlbmRsOwp9CgppbnQgbWFpbigpCnsKICAgIHN0cnVjdCBOb2RlKiBoZWFkID0gTlVMTDsKICAgIGhlYWQgPSBJbnNlcnQoaGVhZCwgMik7CiAgICBoZWFkID0gSW5zZXJ0KGhlYWQsIDQpOwogICAgcHJpbnRMaXN0KGhlYWQpOwogICAgcmV0dXJuIDA7Cn0=