lls.c

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

typedef struct _node {
    int data;
    struct _node *next;
} node;

typedef struct {
	node *head;
	node *tail;
	int size;
} list;

void append(list *l, node *n) {
    l->tail = l->tail->next = n;
}

void printlist(list *l) {
	puts("Printing The List:");
	for(node *current = l->head; current != NULL; current = current->next) {
		printf("%i\n", current->data);
	}
}

int main() {
	node *n3 = malloc(sizeof(node)); n3->data = 7; n3->next = NULL;
	node *n2 = malloc(sizeof(node)); n2->data = 6; n2->next = n3;
	node *n1 = malloc(sizeof(node)); n1->data = 5; n1->next = n2;
	list *l = malloc(sizeof(list));
	l->head = n1;
	l->tail = n3;

	printlist(l);

	node *n4 = malloc(sizeof(node)); n4->data = 8; n4->next = NULL;
	append(l, n4);

	printlist(l);
}