add addBegin and addend

Author: BaseMax

OneWayLinkedList.cpp

@@ -22,8 +22,21 @@ OneWayLinkedList::OneWayLinkedList() {
  this->size = 0;
 }
 
-// Add new node to the end of the list
-void OneWayLinkedList::add(int data) {
+// Add a new node to the beginning of the list
+void OneWayLinkedList::addBegin(int data) {
+ Node* node = new Node(data);
+ if(this->head == NULL) {
+ this->head = node;
+ this->tail = node;
+ } else {
+ node->next = this->head;
+ this->head = node;
+ }
+ this->size++;
+}
+
+// Add a new node to the end of the list
+void OneWayLinkedList::addEnd(int data) {
  Node* node = new Node(data);
  if(this->head == NULL) {
  this->head = node;
@@ -37,10 +50,32 @@ void OneWayLinkedList::add(int data) {
 
 // Print all nodes
 void OneWayLinkedList::print() {
+ if (this->head == NULL) {
+ std::cout << "List is empty" << std::endl;
+ return;
+ }
+
  Node* node = this->head;
- while(node != NULL) {
+ while (node != NULL) {
  std::cout << node->data << std::endl;
  node = node->next;
  }
 }
 
+// Delete all nodes
+void OneWayLinkedList::deleteAll() {
+ Node* node = this->head;
+ while (node != NULL) {
+ Node* next = node->next;
+ delete node;
+ node = next;
+ }
+ this->head = NULL;
+ this->tail = NULL;
+ this->size = 0;
+}
+
+// Support delete operator
+// OneWayLinkedList::~OneWayLinkedList() {
+// this->deleteAll();
+// }

OneWayLinkedList.h

@@ -23,9 +23,18 @@ class OneWayLinkedList {
  // OneWayLinkedList Constructor
  OneWayLinkedList();
 
+ // Add new node to the beginning of the list
+ void addBegin(int data);
+
  // Add new node to the end of the list
- void add(int data);
- 
+ void addEnd(int data);
+
  // Print all nodes
  void print();
+
+ // Delete all nodes
+ void deleteAll();
+
+ // Support delete operator
+ // ~OneWayLinkedList();
 };

example.cpp

@@ -4,16 +4,25 @@
 using namespace std;
 
 int main(int argc, char** argv) {
+ // Create new list
  OneWayLinkedList* list = new OneWayLinkedList();
- list->add(1);
- list->add(2);
- list->add(3);
- list->add(4);
- list->add(5);
+ // Add some nodes
+ list->addEnd(1);
+ list->addEnd(2);
+ list->addEnd(3);
+ list->addEnd(4);
+ list->addEnd(5);
+ list->addEnd(110);
+ list->addBegin(100);
 
+ // Print all nodes
  list->print();
 
- delete list;
+ // Delete all nodes
+ list->deleteAll();
+
+ // Print all nodes
+ list->print();
 
  return 0;
 }