some comments

Llist.cpp

 
 void Llist::insertAfter(Node *p, ElementType d) {
   Node *n;
+
+  // p == NULL is interpreted as prepending
   if (p == NULL) {
     n = new Node(d, head);
     head = n;
 void Llist::printRev() const {
   printRev(head); 
 }
+
 void Llist::printRev(Node *p) const {
   if (p != NULL) {
     printRev(p->next);
 
 void Llist::removeAfter(Node *cur) {
   Node *suc;
+
+  // cur == NULL is interpreted as removing the first
+  // node of the list
   if (cur == NULL and head != NULL) {
     suc = head->next;
     delete head;
     head = suc;
-
+    // in case the removed node was the only node
     if (suc == NULL) tail = NULL;
   }
   else if (cur->next != NULL) {
     suc = cur->next->next;
     delete cur->next;
     cur->next = suc;    
+    // if the removed node was the last, update the tail pointer
     if (suc == NULL) tail = cur;
   }
   length--;
 }
 
+// Assignment operator:
+// 1. empty the list of the invoking object
+// 2. traverse the list of the parameter appending each
+//    node data to the invoking object
+
 Llist& Llist::operator=(const Llist &L) {
   if (this != &L) {
     while(head != NULL) removeAfter(NULL);