//Created By Nautash Ahmad //A sample code for Doubly LL //Link to thread in the comments section #include using namespace std; struct Node { int num; Node* next; Node* prev; }; Node* CreateNode(int num); Node* AddNode(Node *head, int num); Node* DeleteNode(Node *head, int num); void PrintNodes(Node *head); void PrintReverse(Node *head); int main() { Node *head = NULL; for(int i = 1; i <= 10; i++) { head = AddNode(head, i); } cout << "Ascending Order:\n"; PrintNodes(head); cout << "\nDescending Order\n"; PrintReverse(head); head = DeleteNode(head, 10); cout << "Printing nodes\n"; PrintNodes(head); cout << "\nReverse Printing\n"; PrintReverse(head); delete head; return 0; } Node* CreateNode(int num) { Node* newNode = new Node; newNode -> num = num; newNode -> next = NULL; newNode -> prev = NULL; return newNode; } Node* AddNode(Node *head, int num) { Node *newNode = CreateNode(num); if(head == NULL) { head = newNode; } else { Node* temp = head; while(temp -> next != NULL) { temp = temp -> next; } temp -> next = newNode; newNode -> prev = temp; } return head; } void PrintNodes(Node *head) { Node* temp = head; while(temp) { cout << temp -> num << endl; temp = temp -> next; } } void PrintReverse(Node *head) { Node* temp = head; while(temp -> next) { temp = temp -> next; } while(temp) { cout << temp -> num << endl; temp = temp -> prev; } } Node* DeleteNode(Node *head, int num) { cout << "\nDeleting node at position " << num << endl; Node* temp = head; Node* prev = head; while(temp != NULL) { if(temp -> num == num) break; prev = temp; temp = temp -> next; } if(temp == head) { head = head -> next; head -> prev = NULL; } else if(temp -> next == NULL) { prev -> next = NULL; temp -> prev = NULL; } else if(temp == NULL) { cout << "\nNo match found\n"; } else { prev -> next = temp -> next; temp -> next -> prev = prev; } return head; }

[Q&A's] Doubly Linked List v2.0