fork download
copy 
  1. #include <iostream>
  2. #include <string>
  3. using namespace std;
  4. /*=============================== Double Linked List ===============================*/
  5. typedef int elementType;
  6. struct Node
  7. {
  8.     elementType Data;
  9.     Node *Next;
  10.     Node *Previous;
  11. };
  12.  
  13. typedef Node *Position;
  14. class DB_Linked_List
  15. {
  16. private:
  17.     Position Head;
  18.     Position Tail;
  19.     int counter;
  20. public:
  21.     DB_Linked_List()
  22.     {
  23.         MAKENULL();
  24.     }
  25.     void MAKENULL()
  26.     {
  27.         Head = NULL;
  28.         Tail = NULL;
  29.         counter = 0;
  30.     }
  31.     Position FIRST()
  32.     {
  33.         return Head;
  34.     }
  35.     Position END()
  36.     {
  37.         return Tail;
  38.     }
  39.     void INSERT(elementType x , Position p)
  40.     {
  41.         Position new_node = new Node;
  42.         new_node->Data = x;
  43.         if(Head == NULL)
  44.         {
  45.             Head = Tail = new_node;
  46.             new_node->Next = new_node->Previous = NULL;
  47.         }
  48.         else if(p == Head)
  49.         {
  50.             new_node->Next = Head;
  51.             new_node->Previous = NULL;
  52.             Head->Previous = new_node;
  53.             Head = new_node;
  54.         }
  55.         else if(p == Tail || p == NULL)
  56.         {
  57.             new_node->Next = NULL;
  58.             new_node->Previous = Tail;
  59.             Tail->Next = new_node;
  60.             Tail = new_node;
  61.         }
  62.         else
  63.         {
  64.             new_node->Next = p;
  65.             new_node->Previous = p->Previous;
  66.             p->Previous->Next = new_node;
  67.             p->Previous = new_node;
  68.         }
  69.         counter++;
  70.     }
  71.     void DELETE(Position p)
  72. {
  73.     if (p == NULL)
  74.     {
  75.         cout << "Error : NO Elements To Delete\n";
  76.         return;
  77.     }
  78.     if (p == Head)
  79.     {
  80.         Head = Head->Next;
  81.         Head->Previous = NULL;
  82.     }
  83.     else if (p == Tail)
  84.     {
  85.         Tail = Tail->Previous;
  86.         Tail->Next = NULL;
  87.     }
  88.     else
  89.     {
  90.         p->Previous->Next = p->Next;
  91.         p->Next->Previous = p->Previous;
  92.     }
  93.     delete p;
  94.     counter--;
  95. }
  96.  
  97.     void PRINT()
  98.     {
  99.         Position temp = Head;
  100.         while(temp != NULL)
  101.         {
  102.             cout << temp->Data << " ";
  103.             temp = temp->Next;
  104.         }
  105.         cout << endl;
  106.     }
  107.     int SIZE()
  108.     {
  109.         return counter;
  110.     }
  111.     Position NEXT(Position p)
  112.     {
  113.         if(p == Tail || p == NULL)
  114.         {
  115.             cout << "Nothing Next\n";
  116.             return NULL;
  117.         }
  118.         return p->Next;
  119.     }
  120.     Position PREVIOUS(Position p)
  121.     {
  122.         if(p == Head || p == NULL)
  123.         {
  124.             cout << "Nothing Previous\n";
  125.             return NULL;
  126.         }
  127.         return p->Previous;
  128.     }
  129.     elementType RETRIEVE(Position p)
  130.     {
  131.         if(p == NULL)
  132.         {
  133.             cout << "Invalid Position\n";
  134.             return -1;
  135.         }
  136.         return p->Data;
  137.     }
  138.     Position LOCATE(elementType x)
  139.     {
  140.         Position temp = Head;
  141.         while(temp != NULL)
  142.         {
  143.             if(temp->Data == x)
  144.             {
  145.                 return temp;
  146.             }
  147.             temp = temp->Next;
  148.         }
  149.         return NULL;
  150.     }
  151. };
  152. int main()
  153. {
  154.     DB_Linked_List L;
  155.     L.INSERT(1 , L.FIRST());
  156.     L.INSERT(2 , L.FIRST());
  157.     L.INSERT(3 , L.END());
  158.     L.INSERT(4 , L.FIRST());
  159.     L.INSERT(5 , L.END());
  160.     L.INSERT(6 , L.FIRST());
  161.     L.INSERT(7 , L.END());
  162.     L.INSERT(8 , L.END());
  163.     L.INSERT(9 , L.END());
  164.     L.INSERT(10 , L.END());
  165.     L.INSERT(11 , L.FIRST());
  166.     cout << "The Data In List : \n";
  167.     L.PRINT();
  168.     cout << "The Size Of The List = " << L.SIZE() << endl;
  169.     cout << "The List After Deleting The First Node: \n";
  170.     L.DELETE(L.FIRST());
  171.     L.PRINT();
  172.     cout << "The Size After Delete The Element = " << L.SIZE() << endl;
  173.     cout << "The Data In Last Node = " << L.RETRIEVE(L.END()) << endl;
  174.     cout << "The Data In First Node = " << L.RETRIEVE(L.FIRST()) << endl;
  175.     int x;
  176.     cout << "Enter An Element To Return It's Position\n";
  177.     cin >> x;
  178.     Position position = L.LOCATE(x);
  179.     if(position)
  180.     {
  181.         cout << "The Element " << x << " Is Found In The List" << endl;
  182.     }
  183.     else
  184.     {
  185.         cout << "The Element " << x << " Does Not Existing In The List" << endl;
  186.     }
  187.     return 0;
  188. }
  189.  
  190.  
  191.  
  192.  
Success #stdin #stdout 0s 5280KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
The Data In List : 
11 6 4 2 1 3 5 7 8 9 10 
The Size Of The List = 11
The List After Deleting The First Node: 
6 4 2 1 3 5 7 8 9 10 
The Size After Delete The Element = 10
The Data In Last Node = 10
The Data In First Node = 6
Enter An Element To Return It's Position
The Element 0 Does Not Existing In The List
https://ideone.com/fYBThU
language:
C++ (gcc 8.3)
created:
9 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!