double link list in data structure
- 1. Comsats University Islamabad Sahiwal Campus Date: 12/03/2019
- 2. Instructor: Sir Mr M Ahmad Assignment: Data Structure Prepared: Asjad Ali R Reg#: FA18-MCS-0552 #include<iostream> using namespace std; void mainmenu(); struct node { int data; struct node *next; struct node *previous; }; struct node *head, *tmp, *p, *ptr; class linklist { private: int i; public: void add_first_node() { head = new node; cout << "Enter the value of first this node : "; cin >> head->data; head->previous = NULL; head->next = NULL; } void add_node(int a) { p = head; i = 0; do { if (a == p->data) { i++; ptr = new node; cout << "Enter the value of node n"; cin >> ptr->data; ptr->next = p->next; p->next = ptr; ptr->previous = p; tmp = ptr->next; tmp->previous = ptr; } p = p->next; } while (p->next != NULL); if (i == 0) {
- 3. Instructor: Sir Mr M Ahmad Assignment: Data Structure Prepared: Asjad Ali R Reg#: FA18-MCS-0553 cout << a << " dose not exist in link list n"; } } void find_node_num(int a) { i = 1; for (p = head; p != NULL; p = p->next) { if (p->data == a) { cout << " Node = " << i << " And Value =" << p->data << endl; i++; } } if (i == 1) cout << a << " does not Exist in link list n"; } void add_last() { p = head; if (head == NULL) cout << "link list dose not exist n"; else { p = head; while (p->next != NULL) p = p->next; ptr = new node; cout << "Enter the new node value :"; cin >> ptr->data; p->next = ptr; ptr->previous = p; ptr->next = NULL; } } void dalet_node() { p = head; i = 0; do { if (p->data > 50) { if (p == head) { head = head->next;
- 4. Instructor: Sir Mr M Ahmad Assignment: Data Structure Prepared: Asjad Ali R Reg#: FA18-MCS-0554 i++; } else { i++; ptr = p->next; p = p->previous; p->next = ptr; ptr->previous = p; } } p = p->next; } while (p->next != NULL); if (i == 0) { cout << "values in link list do not greater than 50n"; } } void display() { p = head; i = 1; cout << "t Show ALL data in link listn "; while (p != NULL) { cout << i << " Node value = " << p->data << endl; p = p->next; i++; } } }; void mainmenu() { int choice, T; linklist n; cout << "nt==>>MENU<<==n"; cout << "1 for Add node FIRST if data not EXISTn"; cout << "2 for add nod in last in link listn"; cout << "3 for Add node after SPECIFIC data n"; cout << "4 for DELETE node when data GREATER than 50 n"; cout << "5 for FIND node number where data is REAPETED or SAME n"; cout << "6 for DISPLAY all data in link list n";
- 5. Instructor: Sir Mr M Ahmad Assignment: Data Structure Prepared: Asjad Ali R Reg#: FA18-MCS-0555 cout << "7 for EXIT the programme n"; cin >> choice; switch (choice) { case 1: { n.add_first_node(); mainmenu(); break; } case 2: { n.add_last(); mainmenu(); break; } case 3: { cout << "Enter the number after add node n"; cin >> T; n.add_node(T); mainmenu(); break; } case 4: { n.dalet_node(); mainmenu(); break; } case 5: { cout << "Enter the number check repteated : "; cin >> T; n.find_node_num(T);
- 6. Instructor: Sir Mr M Ahmad Assignment: Data Structure Prepared: Asjad Ali R Reg#: FA18-MCS-0556 mainmenu(); break; } case 6: { n.display(); mainmenu(); break; } case 7: { exit(0); break; } default: { cout << "Invalid input n"; mainmenu(); break; } } } int main() { mainmenu(); return 0; }