added implemented stack and queue DS

Author: ophicial-pauloski

binary_search/README.md renamed to Algo/binary_search/README.md

@@ -1,4 +1,4 @@
-//An implementation of a binary search algorithm to search for data in an array in javascript
+//An implementation of a binary search algorithm to search for data in an array in javascript - 
 
 function binary_search(array, user_search_string) {
   let low = 0;

binary_search/app.js renamed to Algo/binary_search/app.js

@@ -0,0 +1,26 @@
+class Queue {
+
+  constructor() {
+    this.items = [];
+  }
+
+  enqueue(element) {
+    this.items.push(element);
+  }
+
+  dequeue() {
+    return this.items.shift();
+  }
+
+  isEmpty() {
+    return this.items.length === 0;
+  }
+
+  front() {
+    return this.items[0];
+  }
+
+  printQueue() {
+    console.log(this.items.toString());
+  }
+}

DS/queue/queue.js

@@ -0,0 +1,55 @@
+class Stack {
+  items = [];
+
+  constructor() {
+    this.items = [];
+  }
+  push(element) {
+    this.items.push(element);
+  }
+  pop() {
+    if (this.items.length === 0) return "underflow, stack empty";
+    return this.items.pop();
+  }
+  peek() {
+    return this.items[this.items.length - 1];
+  }
+  isEmpty() {
+    // return true if stack is empty
+    return this.items.length === 0;
+  }
+
+  printStack() {
+    var str = "";
+    for (var i = 0; i < this.items.length; i++) str += this.items[i] + " ";
+    return str;
+  }
+}
+
+var stack = new Stack();
+
+// testing isEmpty and pop on an empty stack
+
+// returns false
+console.log(stack.isEmpty());
+
+// returns Underflow
+console.log(stack.pop());
+
+// Adding element to the stack
+stack.push(10);
+stack.push(20);
+stack.push(30);
+
+// Printing the stack element
+// prints [10, 20, 30]
+console.log(stack.printStack());
+
+// returns 30
+console.log(stack.peek());
+
+// returns 30 and remove it from stack
+console.log(stack.pop());
+
+// returns [10, 20]
+console.log(stack.printStack());

DS/stack/stack.js

@@ -0,0 +1,21 @@
+/**
+ * Get the smallest number on an array of numbers
+ * @param {Array} n array of numbers
+ */
+function getMin(n) {
+  const array = Array.from(n);
+  let min;
+
+//////
+  for (let i = 0; i < array.length; i++) {
+    if (min === undefined || array[i] < min) {
+        min = array[i]
+    } else if (!array[i] < min) {
+        return 'array props are the same ' + array
+    }
+  }
+///////
+  return min;
+}
+
+console.log(getMin([50, 50, 50, 50]));