55 lines
708 B
JavaScript
55 lines
708 B
JavaScript
module.exports = {
|
|
dsa: [
|
|
"LinearSearchList",
|
|
"BinarySearchList",
|
|
"TwoCrystalBalls",
|
|
"BubbleSort",
|
|
"LinkedList",
|
|
"ArrayList",
|
|
],
|
|
}
|
|
|
|
## Lists
|
|
LinkedList
|
|
* get length(): number;
|
|
* remove(item: T): T | undefined;
|
|
* removeAt(index: number): T | undefined;
|
|
* append(item: T): void;
|
|
* prepend(item: T): void;
|
|
* get(index: number): T | undefined;
|
|
|
|
Queue
|
|
Stack
|
|
|
|
ArrayList
|
|
* Same api as list
|
|
|
|
## Recursion
|
|
The Maze Problem
|
|
Quicksort
|
|
|
|
## Trees
|
|
Binary Tree Traversals
|
|
DFS: pre
|
|
DFS: in
|
|
DFS: post
|
|
|
|
BFS on Binary
|
|
|
|
### Practice Problem
|
|
- Compare Two Binary Trees
|
|
|
|
DFS: Binary Search Tree Traversal
|
|
|
|
RedBlack Trees
|
|
|
|
## Graphs
|
|
DFS
|
|
BFS
|
|
Dijkstra
|
|
|
|
## Map
|
|
Implement Map
|
|
|
|
|
|
|