remove unecessary code from stack and readd printing to Treiber stack

Assignment_3/lib/Stack.cpp

@@ -5,8 +5,6 @@
 #include<sstream>
 
 Stack::Stack(ADTOperationQueue * queue){
-    first = Node::Dummy();
-    first->next = Node::Dummy();
     op_queue = queue;
 }
 
@@ -14,12 +12,4 @@ void Stack::push(int element) { return; }
 int Stack::pop() { return 0; }
 int Stack::size() { return 0; }
 
-std::string Stack::print_stack(){
-    Node* c = this->first->next;
-    std::stringstream ss;
-    while (!c->is_dummy()) {
-        ss << c->get_data() << " ";
-        c = c->next;
-    }
-    return ss.str();
-}
+std::string Stack::print_stack(){ return ""; }

Assignment_3/lib/Stack.h

@@ -7,7 +7,6 @@ class Stack {
     protected:
         ADTOperationQueue * op_queue;
         Stack(ADTOperationQueue * queue);
-        Node* first;
     public:
         void push(int element);
         int pop();

Assignment_3/lib/TreiberStack.cpp

@@ -1,4 +1,5 @@
 #include<stdexcept>
+#include<sstream>
 
 #include "TreiberStack.h"
 #include "ADT_Stack.h"
@@ -43,4 +44,15 @@ int TreiberStack::size() {
     int c = count.load(std::memory_order_relaxed);
     op_queue->enqueue(create_operation(methodname::size, c));
     return c;    
+}
+
+std::string TreiberStack::print_stack(){
+    Node* c = this->top;
+    std::stringstream ss;
+    while (c != NULL) {
+        ss << c->get_data() << " ";
+        c = c->next;
+    }
+    std::string s = ss.str();
+    return s.substr(0, s.find_last_not_of(" ") + 1 );
 }

Assignment_3/lib/TreiberStack.h

@@ -12,4 +12,5 @@ class TreiberStack:public Stack{
         void push(int element);
         int pop();
         int size();
+        std::string print_stack();
 };