* fixed toString method in stack.js implementation. Now reads all elements returns them as a string and uses data property instead of element property that did not exist.

jantabacki · abranhe · commit b3604fa3bdae · 2020-10-07T22:31:01.000-04:00
diff --git a/algorithms/data-structures/stack.js b/algorithms/data-structures/stack.js
@@ -1,12 +1,15 @@
 /**
- * @author Rashik Ansar and Luiz Guerra
- * 
- *
- * Implemtaion of Stack data structure
- * Stack follows LIFO (Last In First Out) priniciple
- * For Insertion and Deletion its complexity is O(1)
- * For Accessing and Searching its complexity is O(n)
- */
+* @author Rashik Ansar and Luiz Guerra
+*
+* Implemtaion of Stack data structure
+* Stack follows LIFO (Last In First Out) priniciple
+* For Insertion and Deletion its complexity is O(1)
+* For Accessing and Searching its complexity is O(n)
+*
+* @author Jan Tabacki
+* Fix in toString method, display all elements and get data property instead of element
+* which does no exist.
+*/
 
 class Stack {
   /**
@@ -63,21 +66,21 @@ class Stack {
     }
     return this.first.data;
   }
-  
+
   /**
    * @returns size of the Stack
    */
   size() {
     return this.size;
   }
-  
+
   /**
    * @returns if Stack is empty
    */
   isEmpty() {
     return this.size == 0;
   }
-  
+
   /**
    * clears the Stack
    */
@@ -86,24 +89,25 @@ class Stack {
     this.last = null;
     this.size = 0;
   }
-  
+
   /**
    * @returns the Stack
    */
   toString() {
-    let str = ""; 
+    let str = "";
     let aux = this.first;
-    for (let i = 0; i < this.count; i++) 
-        str +=  aux.element + " ";
-    		aux = aux.next;
+    while (aux) {
+      str += aux.data + " ";
+      aux = aux.next;
+    }
     return str;
   }
-    
+
 }
 
 class Node {
   constructor(data) {
     this.data = data;
     this.next = null;
   }
-}
+}
