Advertisement
Idanref

Untitled

Mar 17th, 2021
971
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.08 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <string.h>
  4.  
  5. typedef struct Node
  6. {
  7.     int value;
  8.     struct Node *next;
  9. } node;
  10.  
  11. node *create_node(int data);
  12. void insert(node *head, int data);
  13. void print_list(node *head);
  14.  
  15. node *create_node(int data)
  16. {
  17.     node *temp = (node *)malloc(sizeof(node));
  18.     temp->value = data; // current pointer
  19.     temp->next = NULL;
  20.     return temp;
  21. }
  22.  
  23. void insert(node *head, int data)
  24. {
  25.     // 1 -> 2 -> 3 -> NULL
  26.     // -> NULL
  27.  
  28.     node *temp = head;
  29.  
  30.     if(temp == NULL) // 1 item
  31.     {
  32.         temp = create_node(data);
  33.     }
  34.  
  35.     while(temp->next != NULL)
  36.     {
  37.         temp = temp->next;
  38.     }
  39.  
  40.     temp->next = create_node(data);
  41. }
  42.  
  43. void print_list(node *head)
  44. {
  45.     node *temp = head;
  46.  
  47.     while(temp != NULL)
  48.     {
  49.         printf("%d > ", temp->value);
  50.         temp = temp->next;
  51.     }
  52. }
  53.  
  54. void main()
  55. {
  56.     node *head;
  57.  
  58.     head = create_node(1);
  59.  
  60.     insert(head, 8);
  61.     insert(head, 9);
  62.     insert(head, 9);
  63.     insert(head, 10);
  64.     insert(head, 15);
  65.  
  66.     print_list(head);
  67.     printf("\n");
  68. }
  69.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement