• remove() -> O(log(n))

• clear() -> O(1)
• clone() -> O(v+k)

Add a container which is going to show the state of the current Singly Linked List (SLL). After that, add a lot of buttons, one button per method inside of SLL class. Buttons should execute already existing code, I only need TSX elements to make it look nice.

Add a container which is going to show the state of the current Queue. After that, add a lot of buttons, one button per method inside of Queue class. Buttons should execute already existing code, I only need TSX elements to make it look nice.

Create React App and put these two directories "data structures" and "algorithms" inside of it.

The idea is to have the react app which I can later deploy with Netlify to test my data structures & algorithms.

Methods like reverse, sort, and all others that are missing.

Add a container which is going to show the state of the current Binary Search Tree (BST). After that, add a lot of buttons, one button per method inside of Binary Search Tree class. Buttons should execute already existing code, I only need TSX elements to make it look nice.

1. delete(): time complexity -> O(n)
2. clear(): time complexity -> O(1)

Write docs about what is this repository, what does it do, how, when and where.

Also check these:

1. isEdge()
2. isVertex()
3. isEmpty()

• find() -> O(log(n))

1. getVertices() -> O(n)
2. getEdges() -> O(n)

Add a container which is going to show the state of the current Graph. After that, add a lot of buttons, one button per method inside of Graph class. Buttons should execute already existing code, I only need TSX elements to make it look nice.

• values() -> O(n)
• entries() -> O(n)

Add a container which is going to show the state of the current Stack. After that, add a lot of buttons, one button per method inside of Stack class. Buttons should execute already existing code, I only need TSX elements to make it look nice.

Vertex

1. forEachVertex() -> O(n)
2. mapVertices() -> O(n)
3. filterVertices() -> O(n)
4. findVertex() -> O(n)

Edge

1. forEachEdge() -> O(n)
2. mapEdges() -> O(n)
3. filterEdges() -> O(n)
4. findEdge() -> O(n)

• findMin() -> O(log(n))
• findMax() -> O(log(n))

Add a container which is going to show the state of the current Doubly Linked List (DLL). After that, add a lot of buttons, one button per method inside of DLL class. Buttons should execute already existing code, I only need TSX elements to make it look nice.

1. InOrderTraversal() -> O(n)
2. PreOrderTraversal() -> O(n)
3. PostOrderTraversal() -> O(n)

Add a container which is going to show the state of the current Hash Table. After that, add a lot of buttons, one button per method inside of Hash Table class. Buttons should execute already existing code, I only need TSX elements to make it look nice.