#include <iostream> using namespace std ; class node { public: int value ; node * next ; }; void insertAtEnd ( node ** head , int val ){ node * four = NULL ; node * last = * head ; four = new node () ; four -> value = val ; four -> next = NULL ; if (* head == NULL ){ * head = four ; return ; } while ( last -> next != NULL ){ last = last -> next ; } last -> next = four ; return ; } void insertAfter ( node * prev_node , int data ){ if ( prev_node == NULL ) { cout << "The given previous node cannot be NULL" ; return ; } nod...