Advertisement
AshfaqFardin

Untitled

Aug 21st, 2021
131
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.20 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. struct node{
  5. int value;
  6. node* next;
  7. };
  8.  
  9. node* head = NULL;
  10. node* head2 = NULL;
  11. node* head3 = NULL;
  12. node* head4 = NULL;
  13.  
  14. bool isEmpty(){
  15. if(head == NULL){
  16. return true;
  17. }
  18. return false;
  19. }
  20.  
  21. void insert_value(int value, node* &current_node){
  22. if(current_node->next == head){
  23. node* new_node = new node;
  24. new_node->value = value;
  25. new_node->next = NULL; // head
  26. current_node->next = new_node;
  27. new_node->next = head;
  28. }
  29.  
  30. else{
  31. current_node = current_node->next;
  32. }
  33. insert_value(value, current_node->next);
  34. }
  35.  
  36. void print_value(){
  37. cout << "Printing Values\n";
  38. node* print_node = head;
  39. int i = 0;
  40. while(print_node->next != NULL){
  41. cout << print_node->value << endl;
  42. print_node = print_node->next;
  43. i++;
  44. if(i == 5){
  45. return;
  46. }
  47. }
  48. cout << print_node->value;
  49. }
  50.  
  51. int main(){
  52. head->value = 1;
  53. head2->value = 2;
  54. head3->value = 3;
  55. head->next = head2;
  56. head2->next = head3;
  57. head3->next = head;
  58. insert_value(5, head4);
  59. print_value();
  60. return 0;
  61. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement