Revone 3028a78985 Refactor: Abandon the use of Comparable types as keys for the binary tree, as the '>', '>=', '<', '<=' operators are supported by the any type. The heap also adopts the same comparator as the binary tree.		2024-01-29 11:35:24 +08:00
..
binary-tree.ts	Refactor: Abandon the use of Comparable types as keys for the binary tree, as the '>', '>=', '<', '<=' operators are supported by the any type. The heap also adopts the same comparator as the binary tree.	2024-01-29 11:35:24 +08:00
doubly-linked-list.ts	[project] github workflow added. eslint added. formating code by using prettier.	2023-09-21 12:52:17 +08:00
graph.ts	style: reformated codebase	2023-11-16 10:14:14 +08:00
heap.ts	[project] github workflow added. eslint added. formating code by using prettier.	2023-09-21 12:52:17 +08:00
index.ts	[binary-tree, graph] In order to optimize the design of Binary Trees, unnecessary abstract classe removed, while enforcing method constraints between base classes and subclasses through interfaces. For Graph, it is necessary to use an abstract class as the base class, and interface constraints should be applied. Any data structures that are not within the scope of the plan deleted.	2023-10-17 21:06:41 +08:00
navigator.ts	[project] github workflow added. eslint added. formating code by using prettier.	2023-09-21 12:52:17 +08:00
priority-queue.ts	[project] github workflow added. eslint added. formating code by using prettier.	2023-09-21 12:52:17 +08:00
segment-tree.ts	[project] github workflow added. eslint added. formating code by using prettier.	2023-09-21 12:52:17 +08:00
singly-linked-list.ts	[project] github workflow added. eslint added. formating code by using prettier.	2023-09-21 12:52:17 +08:00