second node doesn't print

Why the second node in list doesn't print

Code:

---

#include<stdio.h>#include<stdlib.h>


struct node{
  int Number;
  struct node *next;
};


struct node* newNode(int number, struct node *next) {
    struct node *new = malloc(sizeof(*new));
          new->Number = number;
          new->next = next;
        return new;
}


void show(struct node *head){
    struct node *c;
    c = head;
    while (c!=NULL){
          printf("%d\n",c->Number);
          c = c->next;
          }
 
    }
       
int main (void )
{
    struct node *head = NULL;
        struct node *first = NULL;
        struct node *second = NULL;


       
        first = newNode(10, head);
    head = first;
    second = newNode(20, head);
    head = first;
        show(head);
       
        return 0;
}

---

10

Code:

---

head = first;
show(head);

---

Quote:

---

Originally Posted by stahta01

Code:

---

head = first;
show(head);

---

---

Thanks for point out

Code:

---

    struct node *head = NULL; 
    struct node *first = NULL;
    struct node *second = NULL;
    struct node *third = NULL;

    first = newNode(10, head);
    head = first;
    second = newNode(20, head);
    head = second;
    third = newNode(30, head);
    head = third;
    show(head);

---

30
20
10

I do not want that list

I want to make following
10
20
30

What should I do to make that output ?

You only need ONE variable for your list.

You're confusing yourself with all that first, second, third stuff.

Code:

---

struct node *head = NULL; 
 
head = newNode(10, head);
head = newNode(20, head);
head = newNode(30, head);
show(head);

---

If you want to print 10,20,30, then you need a different newNode() function.
The one you have pushes things to the front of the list.

If you want to append to the list, then you need to write a different function.

Quote:

---

Originally Posted by Salem

You only need ONE variable for your list.

You're confusing yourself with all that first, second, third stuff.
[code]

---

In this case

Code:

---

int main (void ) {
  struct node *head = NULL; 
 
head = newNode(10, head);
head = newNode(20, head);
head = newNode(30, head);
show(head);
   
    return 0;
}

---

What are the steps to delete the node in list I want to make a function that can delete any node