Revone 4fa0816223 [core] Shared Comparator and DFSOrderPattern among multiple data structures. ESLint config improved		2023-10-20 11:43:26 +08:00
..
avl-tree.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
binary-indexed-tree.ts	[project] github workflow added. eslint added. formating code by using prettier.	2023-09-21 12:52:17 +08:00
binary-tree.ts	[core] Shared Comparator and DFSOrderPattern among multiple data structures. ESLint config improved	2023-10-20 11:43:26 +08:00
bst.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
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
rb-tree.ts	[git] Overwrite the rbtree branch based on the old version of the main branch	2023-10-19 09:42:24 +08:00
segment-tree.ts	[pkg] code quality improved to 99%	2023-10-06 20:51:55 +08:00
tree-multiset.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