#include #include "Single_list.h" int main() { Single_list *plist; plist = (Single_list *) malloc( sizeof( Single_list ) ); init_sl( plist ); push_front( plist, 5 ); push_front( plist, 4 ); push_front( plist, 3 ); push_back( plist, 6 ); push_back( plist, 7 ); Single_node *ptr; for ( ptr = plist->head; ptr != NULL; ptr = ptr->next ) { printf( " -> %d", ptr->value ); } printf( "\n" ); pop_front( plist ); pop_front( plist ); push_front( plist, 2 ); push_front( plist, 1 ); for ( ptr = plist->head; ptr != NULL; ptr = ptr->next ) { printf( " -> %d", ptr->value ); } printf( "\n" ); pop_front( plist ); pop_front( plist ); for ( ptr = plist->head; ptr != NULL; ptr = ptr->next ) { printf( " -> %d", ptr->value ); } printf( "\n" ); destroy_sl( plist ); free( plist ); return 0; }