restructure files and add stack DS approach

Author: alguerocode

data structure/basic-queue.js data-structure/queue/basic-queue.js

@@ -6,29 +6,24 @@ class Queue {
     this.arrSize = parseInt(fullSize);
   }
   enqueue(item) {
-    if (this.rear === this.arrSize - 1) {
-      console.log('array full');
+    if (this.rear === this.arrSize - 1) { // true => full queue
       return;
     }
-    if (this.front = -1) { this.front = 0 };
+    if (this.front = -1) { this.front = 0 }; // enqueue action
     this.rear += 1;
     this.queue[this.rear] =item;
-    console.log(this.queue, this.front, this.rear);
   }
   dequeue() {
-    if (this.arrSize === this.front || this.front === -1) {
-
-      console.log('the queue is empty',this.queue);
+    if (this.arrSize === this.front || this.front === -1) { // true => empty queue
       return;
     } 
-    this.queue[this.front] = null;
-    if(this.front >= this.rear) {
+    this.queue[this.front] = null; // dequeue action 
+    if(this.front >= this.rear) {  // if empty => reset 
       this.rear = -1;
       this.front = -1;
-    } else {
+    } else { // else increase the head or front
       this.front += 1
     }
-    console.log(this.queue, this.front, this.rear);
   }
 }
 const newQueue = new Queue(5);

data-structure/stack.js

@@ -0,0 +1,35 @@
+// stack data structure
+
+class Stack {
+  constructor(maxSize) {
+    this.stack = [];
+    this.maxSize = maxSize;
+  }
+  pushing(item) {
+    if (this._isFull()) {
+      console.log('stack is full');
+      return -1;
+    }
+    return this.stack.push(item);
+  }
+  _isEmpty() {
+    return this.stack.length <= 0;
+  }
+  _isFull() {
+    return this.stack.length >= this.maxSize;
+  }
+  peek() {
+    return this.stack[this.stack.length - 1];
+  }
+  poping() {
+    if (this._isEmpty()) {
+      console.log('stack is empty');
+      return -1;
+    }
+    return this.stack.pop();
+  }
+}
+const stack = new Stack(5);
+stack.pushing(6);
+stack.peek();
+stack.poping();