cmoros / laba.solvd-week5

Homework for Laba.solvd nodejs course - Week 5

Week 2 Homework

Laba.Solvd Nodejs Course

About

---

Assignment

1. Create your own realisation of Queue with 2 Stacks

2. Realize class LinkedList with possibilities to add, remove and find element and function to check is there a loop in Linked list (for checking list fir a loop please use Floyd algorithm)

3. (optional) Develop realisation of black-red tree, it should have next functions: add element to the tree, remove element from a tree, find element on a tree, get max and min depth in a tree

Getting Started

---

Prerequisites

npm install npm@latest -g

Installation

1. Clone the repo

   git clone https://github.com/Cmoros/laba.solvd-week5.git

2. Go to the project folder

   cd laba.solvd-week5

3. Install NPM packages

   npm install

Usage

---

To Test All:

npm t

• Test Stack:

   npm run test:stack
  

• Test Queue (With 2 stacks):

   npm run test:queue
  

• Test LinkedList:

   npm run test:linkedlist