char addBeforeData(void *dt,void *dt2,list *lst,char (comp)(void *dt1,void *dt2))
{
node *tmpnd=searchDataNode(dt2,lst,comp);
if(validateNode(tmpnd,lst)=='1')
{
addBeforeNode(dt,tmpnd,lst);
return '0';
}
else
return '1';
}
int main() {
int i, //this represents an iterator for loop
arr[] = {9,8,7,6,25,4,3,23,-11,0}, // the main array
n = sizeof(arr)/sizeof(arr[0]); // the length of the array
for(i = 0; i < n; ++i) {
addToSinglyLinkedList( arr[ i ] );
}
displaySinglyLinkedList( head );
int delval;
printf("Remove Node = ");
scanf("%d", &delval);
removeNode( delval );
displaySinglyLinkedList( head );
head = reverse(head);
printf("Revese Singly Linked List:\n");
displaySinglyLinkedList( head );
printf("After node; what value = ");
int afternode, val;
scanf("%d %d", &afternode, &val);
addAfterNode(afternode, val);
displaySinglyLinkedList( head );
printf("Insert before node; what value = ");
int beforenode;
scanf("%d %d", &beforenode, &val);
addBeforeNode(beforenode, val);
displaySinglyLinkedList( head );
sort();
return(0);
};
