Revone 3a86a5c37d [binary-tree, graph] Replace all code that uses Arrays as makeshift Queues with actual Queues to improve efficiency. [binary-tree] Remove most methods for calculating sums and modifying properties, adopting a generic callback-based design. [bst] Enable default batch addition in BST using sorted binary insertion to maintain tree balance as much as possible.		2023-10-21 23:56:14 +08:00
..
integration	[git] Overwrite the rbtree branch based on the old version of the main branch	2023-10-19 09:42:24 +08:00
types	[heap] fibonacci heap implemented. [test] big O estimate. [project] no-unused-vars config to warn	2023-10-21 01:59:10 +08:00
unit/data-structures	[binary-tree, graph] Replace all code that uses Arrays as makeshift Queues with actual Queues to improve efficiency. [binary-tree] Remove most methods for calculating sums and modifying properties, adopting a generic callback-based design. [bst] Enable default batch addition in BST using sorted binary insertion to maintain tree balance as much as possible.	2023-10-21 23:56:14 +08:00
utils	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