int
main (int argc,
char *argv[])
{
node *t;
init_list ();
ordered_insert (10);
ordered_insert (5);
ordered_insert (8);
ordered_insert (3);
ordered_insert (1);
ordered_insert (7);
ordered_insert (8);
printf ("\nInitial Linked list is ");
print_list (head->next);
printf ("\nFinding 5 is %ssuccessful", find_node (4) == tail ? "un" : "");
t = find_node (5);
printf ("\nFinding 5 is %ssuccessful", t == tail ? "un" : "");
printf ("\nInserting 9 after 5");
insert_after (9, t);
print_list (head->next);
t = find_node (10);
printf ("\nDeleting next last node");
delete_next (t);
print_list (head->next);
t = find_node (3);
printf ("\nDeleting next 3");
delete_next (t);
print_list (head->next);
printf ("\nInsert node 2 before 3");
insert_node (2, 3);
print_list (head->next);
printf ("\nDeleting node 2");
if (!delete_node (2))
printf ("\n deleting 2 is unsuccessful");
print_list (head->next);
printf ("\nDeleting node 1");
delete_node (1);
print_list (head->next);
printf ("\nDeleting all node");
delete_all ();
print_list (head->next);
return 0;
}
int main()
{
struct node * a_list = make_head(5);
add_node(a_list,7);
add_node(a_list,10);
add_node(a_list,15);
struct node * here = locate(a_list,15);
add_node(here,20);
append_node(a_list,25);
print_list(a_list);
delete_node(a_list,20);
printf("deleted 20 \n");
print_list(a_list);
delete_node(a_list,25);
printf("deleted 25\n");
print_list(a_list);
delete_node(a_list,5);
printf("deleted 5\n");
print_list(a_list);
delete_node(a_list,30);
printf("deleted 30\n");
print_list(a_list);
delete_next(a_list);
printf("deleted entry after head\n");
print_list(a_list);
}
~SinglyLinkedList() {
while (head_.next != &z_) {
delete_next(&head_);
}
}
