x/data-structure-typed

mirror of https://github.com/zrwusa/data-structure-typed.git synced 2024-11-09 23:54:04 +00:00

Revone 56f1fabfca 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

3.2 KiB

Raw Blame History

Changelog

All notable changes to this project will be documented in this file.

References

v1.51.1 (upcoming)

Changes

Tests for DirectedGraph.tarjan #69
Rbtree #31
[graph test] edge cases enriched #30
[graph] Modify the data structure design of the graph to change the g… #29
Optimization #23
Optimization #20
[binary-tree, graph] Replace all code that uses Arrays as makeshift Q… #18
1. No need for dfsIterative; integrate it directly into the dfs metho… #17
[heap] fibonacci heap implemented. [test] big O estimate. [project] n… #15
[rbtree] implemented, but with bugs #13
[trie] renamed ambiguous methods and add comments to all methods. #12
[binarytree] modified the getDepth method to adhere to the proper def… #11
Trie #10
[tree] getHeight returns faulty height bug fixed #9
[trie] support casesensitivity. getWords bug fixed #8
[binary-tree, graph] In order to optimize the design of Binary Trees,… #7
[BinaryTree, Heap] In abstract classes, only retain abstract methods.… #6
[heap] test #5
[heap, priority queue] Heap improved. References #123: redesigned #4
test #3

v1.35.0 (11 October 2023)

v1.34.1 (6 October 2023)

v1.33.4 (26 September 2023)

v1.33.3 (26 September 2023)

v1.12.9 (14 August 2023)

v1.12.8 (14 August 2023)

v1.3.6 (21 September 2023)