init

Llist.cpp

@@ -0,0 +1,119 @@
+#include "Llist.h"
+
+void Llist::append(ElementType d){
+  Node *n = new Node(d);
+
+  // in case of empty list
+  if (!head) {
+    head = n;
+  }
+  // otherwise, non empty list...
+  else {
+    tail->next = n;
+  }
+  tail = n;
+  length++;
+}
+
+void Llist::prepend(ElementType d) {
+  Node *n = new Node(d, head);
+  
+  head = n;
+  // in case of empty list the tail = head = n
+  if (length == 0) tail = n;
+
+  length++;
+}
+
+void Llist::display(ostream &out) const {
+  Node *p = head;
+  while(p) {
+    out << p->data << " ";
+    p = p->next;
+  }
+}
+
+void Llist::insertAfter(Node *p, ElementType d) {
+  Node *n;
+  if (p == NULL) {
+    n = new Node(d, head);
+    head = n;
+    if (!tail) tail = n;
+  }
+  else {
+    n = new Node (d, p->next);
+    p->next = n;
+    if (tail == p) tail = n;
+  }
+  length++;
+}
+
+Node* Llist::search(ElementType d) const {
+  Node *p = head;
+  while(p) {
+    if (p->data == d) return p;
+    p = p->next;
+  }
+  return NULL;
+}
+
+ostream& operator<< (ostream &out, const Llist& L) {
+  L.display(out);
+  return out;
+} 
+
+void Llist::printRev() const {
+  printRev(head); 
+}
+void Llist::printRev(Node *p) const {
+  if (p != NULL) {
+    printRev(p->next);
+    cout << p->data << endl;
+  } 
+}
+
+void Llist::removeAfter(Node *cur) {
+  Node *suc;
+  if (cur == NULL and head != NULL) {
+    suc = head->next;
+    delete head;
+    head = suc;
+
+    if (suc == NULL) tail = NULL;
+  }
+  else if (cur->next != NULL) {
+    suc = cur->next->next;
+    delete cur->next;
+    cur->next = suc;    
+    if (suc == NULL) tail = cur;
+  }
+  length--;
+}
+
+Llist& Llist::operator=(const Llist &L) {
+  if (this != &L) {
+    while(head != NULL) removeAfter(NULL);
+    Node *cur = L.head;
+    while (cur != NULL) {
+      append(cur->data);
+      cur = cur->next;
+    }
+  }
+  return *this;
+}
+
+Llist::Llist(const Llist &L) {
+  head = tail = NULL;
+  length = 0;
+  if (this != &L) {
+    Node *cur = L.head;
+    while (cur != NULL) {
+      append(cur->data);
+      cur = cur->next;
+    }
+  }
+}
+
+Llist::~Llist() {
+  while(head != NULL) removeAfter(NULL);
+}

Makefile

@@ -0,0 +1,2 @@
+all: main.cpp Llist.h Llist.cpp
+	g++ -o llist main.cpp Llist.cpp

README.md

@@ -0,0 +1 @@
+List ADT implemented using single linked list

main.cpp

@@ -0,0 +1,38 @@
+ #include <iostream>
+#include "Llist.h"
+using namespace std;
+int main() {
+  Llist L;
+  L.insertAfter(NULL, 9);
+  L.insertAfter(NULL, 5);
+  // L.append(9);
+  L.append(42);
+  L.prepend(3);
+  L.prepend(1);
+
+  L.insertAfter(L.search(9),55);
+  L.insertAfter(L.search(55),85);
+  L.insertAfter(L.search(3),3);
+  L.insertAfter(L.search(3),7);
+  cout << L << endl;
+  // L.printRev();
+  L.removeAfter(L.search(9));
+  cout << L << endl;
+
+  Llist M(L);
+  // Llist M;
+  // M = L;
+
+  cout << M << endl;
+  M.append(19);
+  M.prepend(119);
+  M.insertAfter(M.search(3),59);
+  cout << M << endl;
+  cout << L << endl;
+
+  while (L.getLength() > 0) { 
+    L.removeAfter(NULL);
+    cout << L << endl;
+  }
+
+}