8 commits

Author	SHA1	Message	Date
Revone	7e45aaf609	style: Prettier version updated. Code style adhered to Prettier strictly.	2024-08-27 10:56:04 +12:00
Revone	465744c2ec	feat: Replace the AVLTree with a Red-Black Tree to implement TreeMultiMap, preserving the implementation of TreeMultiMap using AVLTree and renaming it as AVLTreeMultiMap.	2024-01-08 22:22:41 +08:00
Revone	a9c556fce3	docs:Sequential Organization	2023-12-29 16:42:20 +08:00
Revone	dc6ef95f78	style: code base reformat	2023-12-21 10:26:45 +08:00
Revone	8a24a6d7a4	refactor: The binary tree data structure supports custom types for keys	2023-12-04 21:58:41 +08:00
Revone	f9f9df81f5	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
Revone	4930f87bcd	feat: Add an 'elements' parameter to the constructors of all binary tree data structures to accept Iterable types.	2023-11-23 21:43:45 +08:00
Revone	8f9eb82bfd	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