adding deep copy and deep copy nodes

Author: BaseMax

OneWayLinkedList.cpp

@@ -297,6 +297,42 @@ void OneWayLinkedList::deleteNodeBeforeIndex(int index) {
  }
 }
 
+// Maloc a new node
+Node* OneWayLinkedList::mallocNode(int data) {
+ Node* node = new Node(data);
+ return node;
+}
+
+// Deep copy
+// Buggy
+OneWayLinkedList* OneWayLinkedList::deepCopy() {
+ OneWayLinkedList* newList = new OneWayLinkedList();
+ Node* node = this->head;
+ while (node != NULL) {
+ newList->addEnd(node->data);
+ node = node->next;
+ }
+ return newList;
+}
+
+// Deep copy nodes
+Node* OneWayLinkedList::deepCopyNodes() {
+ Node* node = this->head;
+ Node* prev = NULL;
+ Node* newHead = NULL;
+ while (node != NULL) {
+ Node* newNode = mallocNode(node->data);
+ if (prev == NULL) {
+ newHead = newNode;
+ } else {
+ prev->next = newNode;
+ }
+ prev = newNode;
+ node = node->next;
+ }
+ return newHead; 
+}
+
 // Count number of nodes
 int OneWayLinkedList::count() {
  int count = 0;

OneWayLinkedList.h

@@ -29,6 +29,12 @@ class OneWayLinkedList {
  // Add new node to the end of the list
  void addEnd(int data);
 
+ // Deep copy
+ OneWayLinkedList* deepCopy();
+
+ // Deep copy nodes
+ Node* deepCopyNodes();
+
  // Print all nodes
  void print();
 
@@ -53,6 +59,9 @@ class OneWayLinkedList {
  // Check there is a node with a specific data in the list or not (with a recursive function)
  int hasNodeRecursive(int data, Node* node);
 
+ // Maloc a new node
+ Node* mallocNode(int data);
+
  // Delete a node with a specific data
  void deleteNode(int data);
 

example.cpp

@@ -97,10 +97,29 @@ int main(int argc, char** argv) {
  cout << "Node not found" << endl;
  }
 
+ // Deep copy the list
+ cout << "Deep copy the list" << endl;
+ OneWayLinkedList* list2 = new OneWayLinkedList();
+ list2 = list->deepCopy();
+
+ // Deep copy the nodes
+ Node* node2 = list->deepCopyNodes();
+ if (node2 == NULL) {
+ cout << "Node not found" << endl;
+ } else {
+ cout << "Node data: " << node2->data << endl;
+ }
+
  // Delete all nodes
+ cout << "Delete all nodes" << endl;
  list->deleteAll();
 
  // Print all nodes
+ cout << "Print the new list" << endl;
+ list2->print();
+
+ // Print all nodes
+ cout << "Print the first list" << endl;
  list->print();
 
  // Print the size of the list