Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- struct Node
- {
- int data;
- Node *point;
- };
- Node *head;
- Node* getnewnode(int value)
- {
- Node *newnode = new Node();
- newnode -> data = value;
- newnode -> point = NULL;
- return newnode;
- }
- void insertathead(int value)
- {
- Node *newnode = getnewnode(value);
- newnode -> point = head;
- head = newnode;
- }
- void insertattail(int value)
- {
- Node *newnode = getnewnode(value);
- Node *temp=head;
- while(temp->point != NULL)
- {
- temp=temp->point;
- }
- temp->point = newnode;
- }
- void insertatanyindex(int n, int value)
- {
- Node *newnode= getnewnode(value);
- if(n==1)
- {
- newnode->point = head;
- head = newnode;
- return;
- }
- Node *temp = head;
- for(int i=1; i<n-1; i++)
- {
- temp = temp->point;
- }
- newnode->point = temp->point;
- temp->point = newnode;
- }
- void deleteanyindex(int n)
- {
- Node *temp = head;
- if(n==1)
- {
- head = temp->point;
- delete temp;
- }
- else
- {
- int i;
- for(i=1; i<n-1; i++)
- {
- temp = temp->point;
- }
- Node *temp2 = temp->point;
- temp->point = temp2->point;
- delete temp2;
- }
- }
- void print()
- {
- Node *temp = head;
- while(temp->point != NULL)
- {
- cout << temp->data << " ";
- temp = temp->point;
- }
- cout << temp->data << endl;
- }
- void Search(int value)
- {
- Node *temp=head;
- while(temp->point != NULL)
- {
- if(temp->data == value)
- {
- cout << "Found"<<endl;
- return;
- }
- else
- {
- temp = temp->point;
- }
- }
- if(temp->data == value)
- {
- cout << "Found"<<endl;
- return;
- }
- else
- {
- cout << "Not Found" <<endl;
- }
- }
- int main()
- {
- int data,limit,i,del,value;
- cout << "Input size of link list: ";
- cin >> limit;
- for(i=1; i<=limit; i++)
- {
- cout << "Input data: ";
- cin >> data;
- insertatanyindex(i,data);
- }
- print();
- cout << "Delete index: ";
- cin >> del;
- deleteanyindex(del);
- print();
- cout << "Input data for Search: ";
- cin >> value;
- Search(value);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement