data-structure-typed/test/unit/data-structures
2023-10-18 14:57:47 +08:00
..
binary-tree [core] In order to adhere to best practices, rename the DFS method and the BFS method as dfs and bfs. 2023-10-10 22:15:01 +08:00
graph [test] test bug fixed 2023-10-11 23:36:10 +08:00
hash [core] HashTable, HashMap, SkipList implemented 2023-09-29 17:37:30 +08:00
heap [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
linked-list [test] double the time 2023-10-12 09:02:59 +08:00
matrix [test] eslint test directary and format 2023-09-26 19:43:45 +08:00
priority-queue [BinaryTree, Heap] In abstract classes, only retain abstract methods. Replace the generic 'T' with 'E' in Heap and PriorityQueue 2023-10-16 20:34:22 +08:00
queue [test] eslint test directary and format 2023-09-26 19:43:45 +08:00
stack [test] Test case coverage is 63.1%. 2023-09-26 17:06:17 +08:00
tree [core] renamed id to key 2023-10-10 19:55:52 +08:00
trie [trie] support casesensitivity. getWords bug fixed 2023-10-18 14:57:47 +08:00