Stacks

.nycrc

@@ -1,3 +1,3 @@
 {
-    "extends": "@istanbuljs/nyc-config-babel"
+  "extends": "@istanbuljs/nyc-config-babel"
 }

README.md

@@ -16,41 +16,53 @@ JavaScript is also a flexible language that allows performing actions that could
 Read all the content of [**Data Structures and Algorithms** here](./content.md)
 
 ## Using this repository
+
 ### Prerequisites
+
 You will need to have node installed. I recommend using the [nvm installer script](https://github.com/nvm-sh/nvm#install--update-script), and following their [instructions](https://github.com/nvm-sh/nvm#usage). I recommend using the `v20.12.2` version.
 
 ### Clone
+
 ```bash
 git clone [email protected]:mesirendon/datastructures-and-algorithms-js.git
 ```
 
 ### Install dependencies
+
 ```bash
 npm ci
 ```
 
 ### Run tests
+
 #### All Tests
+
 Running all tests will show a coverage report.
+
 ```bash
 npm t
 ```
 
 #### Specific
+
 ```bash
 npm run test:case src/singly-linked-lists/__test__/linked-lists.spec.js
 ```
 
 ### Start the app
+
 You can use the provided index.js as a playground by running in a console the following command.
+
 ```bash
 npm start
 ```
 
 When you modify the [index.js](./index.js) file and save it, the service will be reloaded.
 
 ## Disclaimer ⚠️
+
 This repository is meant to be used as an educational and research tool. Therefore, you should think twice before copying and pasting the code seen here in your production developments. Also, remember this code is licensed under [MIT License](./LICENSE), thus limiting any warranty or liability for its use.
 
 ## Acknowledgement
+
 [Trekhleb](https://github.com/trekhleb)'s [JavaScript Algorithms](https://github.com/trekhleb/javascript-algorithms) repository heavily inspires this repository.

babel.config.json

@@ -9,9 +9,7 @@
   ],
   "env": {
     "test": {
-      "plugins": [
-        "istanbul"
-      ]
+      "plugins": ["istanbul"]
     }
   }
 }

content.md

@@ -24,4 +24,11 @@
       - [Queue Wrapper](./src/data-structures/queues/Queue.js)
     - Tests
       - [Queue Node and Queue Wrapper](./src/data-structures/queues/__test__/queue.spec.js)
+  - [Stack](./src/data-structures/stack/Stack.ipynb)
+    - Implementation
+      - [Stack Node](./src/data-structures/stack/StackNode.js)
+      - [Stack Wrapper](./src/data-structures/stack/Stack.js)
+    - Tests
+      - [Stack Node and Stack Wrapper](./src/data-structures/stack/__test__/stack.spec.js)
     - **TODO:** List of exercises
+    - **TODO:** Applications?

src/data-structures/README.md

@@ -1,6 +1,7 @@
 [Back to Content](../../content.md)
 
 # Data Structures
+
 Data is a broad term that could mean any type of information. Structuring such information is related to organizing and storing it for future access or manipulation in an efficient manner.
 
 **Note on exercises**: I'm not using the actual implementation here because

src/data-structures/queues/QueueNode.js

@@ -11,7 +11,7 @@ export default class QueueNode {
 
   /**
    *  Returns a string representation of this node.
-   * 
+   *
    * Could be specified through a function.
    * @param {function} customFn  Custom stringifier
    * @returns {string} This node string representation

src/data-structures/queues/Queues.ipynb

@@ -370,7 +370,7 @@
     "| Peek      | $O(1)$              |\n",
     "\n",
     "## Space Complexity\n",
-    "Linked lists have $O(n)$ space complexity.\n",
+    "Queues have $O(n)$ space complexity.\n",
     "\n",
     "## Bibliography\n",
     "1. JavaScript Data Structures and Algorithms[^1]\n",

src/data-structures/singly-linked-lists/exercises/README.md

@@ -1,6 +1,7 @@
 [Back to Content](../../../../content.md)
 
 # Singly Linked Lists Exercises
+
 The following are some proposed exercises that use the concepts learned with Singly Linked Lists.
 
 - [Merge Two Sorted Lists (as nodes)](./merge-two-sorted-lists/index.ipynb)