data-structure-typed/test/unit/data-structures
2023-11-01 17:51:38 +08:00
..
binary-tree [binary-tree] Let the get method call getNode instead of getNodes. [rbtree] Use rigorous testing to verify that the properties of nodes in a red-black tree adhere to the red-black tree rules after insertion and deletion. 2023-11-01 17:51:38 +08:00
graph [core] All data structures have had their member variables access control optimized. 2023-10-31 11:15:39 +08:00
hash [core] Besides Binary Trees and Graphs, access control optimizations have been applied to member variables. 2023-10-31 10:34:41 +08:00
heap [binary-tree] bug fix#27 2023-10-30 11:14:41 +08:00
linked-list [core] Besides Binary Trees and Graphs, access control optimizations have been applied to member variables. 2023-10-31 10:34:41 +08:00
matrix [test] Increase the test coverage to 89.51. 2023-10-28 23:54:27 +08:00
priority-queue [binary-tree] bug fix#27 2023-10-30 11:14:41 +08:00
queue [queue] Added some alias methods. 2023-10-31 09:03:06 +08:00
stack [test] Test case coverage is 63.1%. 2023-09-26 17:06:17 +08:00
tree [tree] tests passed 2023-10-18 17:10:31 +08:00
trie 1. No need for dfsIterative; integrate it directly into the dfs method. 2. Allow for public configuration of setLoopType. 3. Replace subTreeAdd with subTreeForeach for improved clarity and flexibility; provide a callback for enhanced versatility. 4. Standardize the naming of certain methods and parameters. 2023-10-21 20:03:54 +08:00