Revone bbfa64fc64 fix: Fix the bug in the getCycles method. refactor: Rename some variables.		2023-12-19 12:15:44 +08:00
..
binary-tree	refactor: Unify the return types of all methods and align them with Java, extract the print and hasValue methods to base class. This will make the code more consistent and easier to understand.	2023-12-12 21:14:17 +08:00
graph	fix: Fix the bug in the getCycles method. refactor: Rename some variables.	2023-12-19 12:15:44 +08:00
hash	refactor: Unify the return types of all methods and align them with Java, extract the print and hasValue methods to base class. This will make the code more consistent and easier to understand.	2023-12-12 21:14:17 +08:00
heap	fix: Fix the bug in the getCycles method. refactor: Rename some variables.	2023-12-19 12:15:44 +08:00
linked-list	refactor: Unify the return types of all methods and align them with Java, extract the print and hasValue methods to base class. This will make the code more consistent and easier to understand.	2023-12-12 21:14:17 +08:00
matrix	style: reformated codebase	2023-11-16 10:14:14 +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: Unify the return types of all methods and align them with Java, extract the print and hasValue methods to base class. This will make the code more consistent and easier to understand.	2023-12-12 21:14:17 +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	refactor: Unify the return types of all methods and align them with Java, extract the print and hasValue methods to base class. This will make the code more consistent and easier to understand.	2023-12-12 21:14:17 +08:00