Guest User

Untitled

a guest
Jan 17th, 2019
100
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.70 KB | None | 0 0
  1. struct node{
  2. int value;
  3. struct node* next;
  4. };
  5.  
  6. void addFirst(struct node *list, int value){
  7. struct node *new_node = (struct node*) malloc (sizeof (struct node));
  8. new_node->value = value;
  9. new_node->next = list;
  10. list = new_node;
  11. }
  12.  
  13. struct node *my_list = null;
  14. addFirst((struct node *)&my_list, 123);
  15.  
  16. void addFirst(struct node *list, int value){
  17. struct node **real_list = (struct node **)list;
  18. struct node *new_node = (struct node*) malloc (sizeof (struct node));
  19. new_node->value = value;
  20. new_node->next = *real_list;
  21. *real_list = new_node;
  22.  
  23. void addFirst(struct node **list, int value){
  24. struct node *new_node = (struct node*) malloc (sizeof (struct node));
  25. new_node->value = value;
  26. new_node->next = *list;
  27. *list = new_node;
  28. }
  29.  
  30. struct node * addFirst(struct node *list, int value){
  31. struct node *new_node = (struct node*) malloc (sizeof (struct node));
  32. new_node->value = value;
  33. new_node->next = list;
  34. return new_node;
  35. }
  36.  
  37. head = addfirst(head,45);
  38.  
  39. void addFirst(struct node **list, int value){
  40. struct node *new_node = (struct node*) malloc (sizeof (struct node));
  41. new_node->value = value;
  42. new_node->next = *list;
  43. *list = new_node;
  44. }
  45.  
  46. void addFirst(struct node **list, int value){
  47. struct node *new_node = (struct node*) malloc (sizeof (struct node));
  48. new_node->value = value;
  49. new_node->next = *list;
  50. *list = new_node;
  51. }
  52.  
  53. addFirst(&list, value);
  54.  
  55. struct node *head;
  56.  
  57. void addFirst(struct node *list, int value){
  58. struct node *new_node = (struct node*) malloc (sizeof (struct node));
  59. new_node->value = value;
  60. new_node->next = list->next;
  61. list->next = new_node;
  62. }
  63.  
  64. addFirst(head, 45);
Add Comment
Please, Sign In to add comment