Revone e1e672b3b5 refactor: Extract the isNode and exemplarToNode methods to achieve best practices.		2023-11-27 13:38:26 +08:00
..
binary-tree	refactor: Extract the isNode and exemplarToNode methods to achieve best practices.	2023-11-27 13:38:26 +08:00
graph	feat: Implement the [Symbol.iterator], forEach, filter, map, and reduce methods for Graph, specifically targeting the nodes. fix: type error fixed	2023-11-27 11:24:23 +08:00
hash	fix: type fixed	2023-11-25 22:33:38 +08:00
heap	feat: To support conversion between data structures, Heap, PriorityQueue, Queue, Deque, SinglyLinkedList, DoublyLinkedList, and Stack have all added an 'elements' parameter for initializing the elements of the data structure.	2023-11-23 18:40:30 +08:00
linked-list	refactor: In Linked List data structures, only use 'undefined' and abandon the design where both 'null' and 'undefined' coexist.	2023-11-27 09:31:11 +08:00
matrix	style: Change ESLint configuration from error type to warning type. Format the code.	2023-11-16 11:55:40 +08:00
priority-queue	feat: To support conversion between data structures, Heap, PriorityQueue, Queue, Deque, SinglyLinkedList, DoublyLinkedList, and Stack have all added an 'elements' parameter for initializing the elements of the data structure.	2023-11-23 18:40:30 +08:00
queue	refactor: In Stack data structures, only use 'undefined' and abandon the design where both 'null' and 'undefined' coexist.	2023-11-27 09:38:03 +08:00
stack	refactor: In Stack data structures, only use 'undefined' and abandon the design where both 'null' and 'undefined' coexist.	2023-11-27 09:38:03 +08:00
tree	style: reformated codebase	2023-11-16 10:14:14 +08:00
trie	feat: Perfectly implement fast conversion between data structures. Implement a getter size for Trie. docs: Add comments to the 'add' and 'addMany' methods of all binary tree data structures.	2023-11-25 22:32:09 +08:00
index.ts	[project] github workflow added. eslint added. formating code by using prettier.	2023-09-21 12:52:17 +08:00