View difference between Paste ID: 14L6Vph8 and 8hN0GLQv

 #include <iostream>
 
 using namespace std;
 
 struct Node {
   char data;
   Node* next;
 };
-struct Node
+
 class Stack {
-    char data;
+  public:
-    Node* next;
+    Node* head;
     int size;
     void add(char value);
-class Stack
+    void output();
     Stack();
-    public:
+    ~Stack();
-        Node* head;
+
-        int size;
+
-        void add(char value);
+int main() {
-        char pop();
+  Stack stack1;
-        void output();
+  stack1.add('h');
-        Stack();
+  stack1.add('e');
-        ~Stack();
+  stack1.add('l');
   stack1.add('l');
   stack1.add('o');
   stack1.output();
-int main()
+
   return 0;
-    Stack stack1;
+
-    stack1.add('h');
+
-    stack1.add('e');
+
-    stack1.add('l');
+  :size(0) {}
-    stack1.add('l');
+
-    stack1.add('o');
+Stack::~Stack() {
-    stack1.output();
+  Node* cursor = head;
-
+  Node* next;
-
+
-    return 0;
+  while (cursor != NULL)
   {
     next = cursor->next;
     delete cursor;
     cursor = NULL;
     cursor = next;
-      :size(0){}
+  }
-
+
 
-Stack::~Stack()
+void Stack::add(char value) {
   if (size == 0) {
     head = new Node;
-    Node* cursor;
+    head->data = value;
-    Node* next;
+    head->next = NULL;
-
+  } else {
-    /*
+    Node* ptr = new Node;
-    cout << endl << endl << "random shit" << endl << endl ;
+    ptr->data = value;
-    if (size > 0)
+    ptr->next = head;
-    {
+    head = ptr;
-        cursor = head->next;
+  }
-    }
+  ++size;
-
+
-    cout << endl << endl << cursor->data << endl << endl ;
+
-
+
 {
-    */
+  Node* cursor = head;
-    while (cursor != NULL)
+  while (cursor && cursor->next) {
-    {
+
-        //toDelete = cursor;
+    cursor = cursor->next;
-        next = cursor->next;
+  }
-        delete cursor;
+  if (cursor) { cout << cursor->data << endl; }
-        cursor = NULL;
+