fork download
  1. #include <iostream>
  2. using namespace std;
  3. #define null NULL
  4. class node
  5. {
  6. public :
  7. int data;
  8. node * next;
  9. node * prev;
  10. };
  11. class doublelinkedlist
  12. {
  13. public :
  14. node * head;
  15. doublelinkedlist()
  16. {
  17. head=null;
  18. }
  19. void insert_first(int x)
  20. {
  21. node * newnode=new node;
  22. newnode->data=x;
  23. newnode->next=head;
  24. newnode->prev=null;
  25. if(head!=null)
  26. {
  27. head->prev=newnode;
  28. }
  29. head=newnode;
  30. }
  31. void insert_last(int x)
  32. {
  33. node * newnode=new node;
  34. newnode->data=x;
  35. newnode->next=null;
  36. newnode->prev=null;
  37. if(head==null)
  38. {
  39. head=newnode;
  40.  
  41. }
  42. else
  43. {
  44. node * temp=head;
  45. while(temp->next!=null)
  46. {
  47. temp=temp->next;
  48. }
  49. temp->next=newnode;
  50. newnode->prev=temp;
  51. }
  52. }
  53. void delete_first()
  54. {
  55. if(head==null)
  56. {
  57. cout<<"invalid operation \n";
  58. return ;
  59. }
  60. else
  61. {
  62. node * temp=head;
  63. head=head->next;
  64. if(head!=null)
  65. {
  66.  
  67. head->prev=null;
  68. }
  69. delete temp;
  70. }
  71. }
  72. void delete_last()
  73. {
  74. if(head==null)
  75. {
  76. cout<<"list empty\n";
  77. return ;
  78. }
  79. node * temp=head;
  80. while(temp->next!=null)
  81. {
  82. temp=temp->next;
  83. }
  84. if(temp->prev==null)
  85. {
  86. head=null;
  87. }
  88. else
  89. {
  90. temp->prev->next=null;
  91. }
  92. delete temp;
  93. }
  94. void delete_byvalue(int x)
  95. {
  96. node * temp = head;
  97. while(temp!=null&& temp->data!=x)
  98. {
  99. temp=temp->next;
  100. }
  101. if(temp==null)
  102. {
  103. cout<<"not found the value \n";
  104. return ;
  105. }
  106. if(temp->prev==null)
  107. {
  108. head=temp->next;
  109. }
  110. else
  111. {
  112. temp->prev->next=temp->next;
  113. }
  114. if(temp->next!=null)
  115. {
  116. temp->next->prev=temp->prev;
  117. }
  118. delete temp;
  119. }
  120. void printfrombegging()
  121. {
  122. node * temp=head;
  123. if(head==null)
  124. {
  125. cout<<"list is empty\n";
  126. return ;
  127. }
  128. while(temp!=null)
  129. {
  130. cout<<temp->data <<" ";
  131. temp=temp->next;
  132. }
  133. cout<<"\n";
  134.  
  135. }
  136. void printfromend()
  137. {
  138. if(head==null)
  139. {
  140. cout<<"list is empty\n";
  141. return ;
  142. }
  143. node * temp=head;
  144. while(temp->next!=null)
  145. {
  146. temp=temp->next;
  147. }
  148. if(temp->prev==null)
  149. {
  150. cout<<temp->data<<"\n";
  151. return ;
  152. }
  153. while(temp!=null)
  154. {
  155. cout<<temp->data<<" ";
  156. temp=temp->prev;
  157. }
  158.  
  159. }
  160. };
  161. int main()
  162. {
  163. doublelinkedlist test;
  164. test.insert_last(10);
  165. test.insert_last(20);
  166. test.insert_last(30);
  167.  
  168. cout<<"Original List: ";
  169. test.printfrombegging();
  170.  
  171. test.insert_first(5);
  172.  
  173. cout<<"After Insert First: ";
  174. test.printfrombegging();
  175.  
  176. cout<<"Backward: ";
  177. test.printfromend();
  178.  
  179. test.delete_first();
  180.  
  181. cout<<"\nAfter Delete First: ";
  182. test.printfrombegging();
  183.  
  184. test.delete_last();
  185.  
  186. cout<<"After Delete Last: ";
  187. test.printfrombegging();
  188.  
  189. test.delete_byvalue(20);
  190.  
  191. cout<<"After Delete Value 20: ";
  192. test.printfrombegging();
  193.  
  194. test.delete_byvalue(100);
  195.  
  196. cout<<"Final List: ";
  197. test.printfrombegging();
  198.  
  199. return 0;
  200. }
Success #stdin #stdout 0s 544KB
stdin
Standard input is empty
stdout
Original List: 10 20 30 
After Insert First: 5 10 20 30 
Backward: 30 20 10 5 
After Delete First: 10 20 30 
After Delete Last: 10 20 
After Delete Value 20: 10 
not found the value 
Final List: 10