Programming

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

struct LinkedList
{
        int val;
        struct LinkedList *next;
}node; /*Creating a structure variable*/

typedef struct LinkedList Node;
Node *start = NULL;
int create(int i)
{
        Node *temp = NULL;
        if (start == NULL)
        {
                start = (Node*)malloc(sizeof(node)); /*creating space for start*/
                start->val = i;
                start->next=NULL;
                return 0;
        }
        else
                temp = start;
                while(temp != NULL) /*traversing to last node*/
                {
                        printf("Value in temp = %d\n", temp->val);
                        temp=temp->next;
                }
                temp = (Node*)malloc(sizeof(node));
                temp->val = i;
                start->next= temp; /*Start pointing to newly created node*/
                temp->next = NULL;
                return 0;
}

void display()
{
        Node *temp = NULL;
        printf("Displaying List\n");
        if (start == NULL)
                printf("List is Empty\n");
        else
        {
                temp = start;
                while(temp != NULL)
                {
                        printf("%d      ", temp->val);
                        temp = temp->next;
                }
        }
}

int main()
{
        int j =0;
        for(j; j <= 10; j++)
        {
                create(j);
        }
        display();
        return 0;
}

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

struct LinkedList
{
int val;
struct LinkedList *next;
}node; /*Creating a structure variable*/

typedef struct LinkedList Node;
Node *start = NULL;
int create(int i)
{
Node *temp = start;
while(temp != NULL) /*traversing to last node*/
{
printf("Value in temp = %d\n", temp->val);
temp=temp->next;
}
temp = (Node*)malloc(sizeof(node));
temp->val = i;
temp->next = start; /* link this node to the start of the list */
start = temp; /* this node becomes the new start */
return 0;
}

void display()
{
Node *temp = NULL;
printf("Displaying List\n");
if (start == NULL)
printf("List is Empty\n");
else
{
temp = start;
while(temp != NULL)
{
printf("%d ", temp->val);
temp = temp->next;
}
}
}

int main()
{
int j =0;
for(j; j <= 10; j++)
{
create(j);
}
display();
return 0;
}

...
Node *start = NULL;
Node *end = NULL;

int create (int i) {
...
temp = (Node*)malloc(sizeof(node));
temp->val = i;
temp->next = NULL;
if ( start == NULL ) {
  start = temp; /* the first node becomes the start */
} else {
  end->next = temp; /* link last node to this node */
}
end = temp; /* update the end pointer */
...
}
...