Printing List Reversing Lines

#include <stdio.h>

typedef struct list {
	char c;
	struct list *next;
} list ;

void printlist(list *b) {
	list *newline=NULL;
	while( b!=NULL ) {
		if (b->c=='\n') {
	   		return;
	  	}
	  	printlist(b->next);
	  	printf("%c",b->c);
		return;
	  }
}

list *insertlist( char ch, list *temp ) {
	list *t = calloc( 1, sizeof( list ) );
	t->c = ch; 
	t->next = temp;
	return t;
}

int main ( void ) {
	char c;
	list *b = NULL;
	while(1) {
		c=getchar();
		if( c == '.' ) {
			break;
		} else {
			b = insertlist( c, b ); 
		}
	} 
	printlist(b);
	printf("\n");
	return 0;
}

typedef struct list {
	char word[30];
	struct list *next;
} list ;

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

// prev points to the memory location of the previous node in the list.
//  If there are none we point to NULL. Also, the first node prev pointer will point to NULL
// next points to memory location of the next node in the list.
//  If there are no next nodes, next will point to NULL.  For example, the last node in the 
//  linked list will have its next point point to NULL since there are obviously no nodes
//  after the last node.
typedef struct list {
	char c;
	struct list *prev;
	struct list *next;
} list;

// The head pointer marks the starting point of the link list
// The tail pointer marks the end of the link list.
// These two pointers allow you to traverse the doubly linked
//  list from beginning to end and vice versa

struct list *head = NULL, *tail = NULL;


void insertlist( list *lnode )
{
	// Add the node to an empty list
	if(head == NULL)
	{
		// head pointer points to first and only node
		head = lnode;
		// prev pointer points to null since ther is no previous node
		lnode->prev = NULL;
	}
	// Append node to end of list
	else
	{
		// Set the current tail's next pointer to the new node
		tail->next = lnode;
		// Set new node prev pointer to current tail
		lnode->prev = tail;
	}
	// Point the tail to the new node;
	tail = lnode;
	// Finally point the new node next to NULl since ther is no next record
	lnode->next = NULL;
}

int main ( void ) 
{
	list *b = NULL;
	// Allocate memory for the new node
	if(( b = ( struct list * )malloc( sizeof(struct list ))) == NULL )
	{
		printf( "malloc failed\n" );
		return -1;
	}
	b->c = 'a';
	insertlist( b ); 
	// Allocate memory for another new node;
	if(( b = ( struct list * )malloc( sizeof(struct list ))) == NULL )
	{
		printf( "malloc failed\n" );
		return -1;
	}
		b->c = 'b';
	insertlist( b ); 

	// Traverse forward
	for( b = head; b != NULL; b = b->next ) 
		printf( "%c\n", b->c );

	printf("\n\n\n");
	// Traverse backward
	for( b = tail; b != NULL; b = b->prev ) 
		printf( "%c\n", b->c );

	return 0;
}