Haval1

labQuasetion

May 3rd, 2019
269
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.27 KB | None | 0 0
  1. #include"iostream"
  2. #include"string"
  3. using namespace std;
  4. struct node
  5. {
  6.     int data;
  7.     node* prev;
  8.     node* next;
  9. };
  10. void insert(node*& head, node*& tail, int item)
  11. {
  12.     node* newNode = new node;
  13.     newNode->data = item;
  14.     newNode->next = NULL;
  15.     newNode->prev = NULL;
  16.     if (head == NULL)
  17.     {
  18.         head = tail = newNode;
  19.         return;
  20.     }
  21.     else
  22.     {
  23.         newNode->next = head;
  24.         head->prev = newNode;
  25.         head = newNode;
  26.     }
  27. }
  28. void merge(node*& head, node*& tail, node*& head1)
  29. {
  30.     node* temp = new node;
  31.     temp = tail;
  32.     if (head == NULL)
  33.     {
  34.         cout << "Empty\n";
  35.         return;
  36.     }
  37.     else
  38.     {
  39.         if (temp->next == NULL)
  40.         {
  41.             temp->next = head1;
  42.             head1->prev = temp;
  43.         }
  44.     }
  45. }
  46. void dis(node*& head, node*& tail1)
  47. {
  48.     node* temp = new node;
  49.     temp = tail1;
  50.     if (head == NULL)
  51.     {
  52.         cout << "Empty\n";
  53.         return;
  54.     }
  55.     else
  56.     {
  57.         while (temp != NULL)
  58.         {
  59.             cout << "--| " << temp->data << endl;
  60.             temp = temp->prev;
  61.         }
  62.     }
  63. }
  64. int main()
  65. {
  66.     node* head, * tail,*head1,*tail1;
  67.     head = tail = head1 = tail1 = NULL;
  68.     int i, item;
  69.     for (i = 0; i < 4; i++)
  70.     {
  71.         cout << "Data is : ";
  72.         cin >> item;
  73.         insert(head, tail, item);
  74.     }
  75.     for (i = 0; i < 4; i++)
  76.     {
  77.         cout << "Data is : ";
  78.         cin >> item;
  79.         insert(head1, tail1, item);
  80.     }
  81.     merge(head, tail, head1);
  82.     dis(head, tail1);
  83. }
Advertisement
Add Comment
Please, Sign In to add comment