Revone 25e9f36577 feat: Remove the meaningless Tree data structure. ... refactor: Adjust the logic of isRealNode for a slight performance improvement. docs: table fixed		2024-01-16 11:26:43 +08:00
..
binary-tree	refactor: Renaming SENTINEL to NIL and placing the NIL node in the BinaryTree allows for direct equality checks in isNIL and isRealNode, avoiding excessive operations to improve performance. As a result, the performance of the get method in AVLTree has tripled.	2024-01-15 21:05:42 +08:00
graph	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
hash	fix: Fix bug #71.	2024-01-03 15:52:10 +08:00
heap	fix: Fix bug #71.	2024-01-03 15:52:10 +08:00
linked-list	Refactor: Standardize addition and removal methods for all sequential data structures to push, pop, shift, unshift.	2024-01-09 12:04:50 +08:00
matrix	refactor: Remove the _addTo method from BinaryTree and TreeMultiMap.	2023-12-22 19:59:38 +08:00
priority-queue	efactor: completely eliminate the use of enumerations	2024-01-14 19:49:50 +08:00
queue	Refactor: Standardize addition and removal methods for all sequential data structures to push, pop, shift, unshift.	2024-01-09 12:04:50 +08:00
stack	fix: Fix bug #71.	2024-01-03 15:52:10 +08:00
trie	fix: Fix bug #71.	2024-01-03 15:52:10 +08:00