This is a standalone Tree Multiset data structure from the data-structure-typed collection. If you wish to access more data structures or advanced features, you can transition to directly installing the complete data-structure-typed package
npm i tree-multimap-typed --saveyarn add tree-multimap-typed| Data Structure | Unit Test | Performance Test | API Docs |
|---|---|---|---|
| Tree Multimap | TreeMultimap |
| Data Structure Typed | C++ STL | java.util | Python collections |
|---|---|---|---|
| TreeMultimap<K, V> | multimap<K, V> | - | - |
rb-tree
| test name | time taken (ms) | executions per sec | sample deviation |
|---|---|---|---|
| 100,000 add | 85.85 | 11.65 | 0.00 |
| 100,000 add & delete randomly | 211.54 | 4.73 | 0.00 |
| 100,000 getNode | 37.92 | 26.37 | 1.65e-4 |
| Algorithm | Function Description | Iteration Type |
|---|---|---|
| Binary Tree DFS | Traverse a binary tree in a depth-first manner, starting from the root node, first visiting the left subtree, and then the right subtree, using recursion. | Recursion + Iteration |
| Binary Tree BFS | Traverse a binary tree in a breadth-first manner, starting from the root node, visiting nodes level by level from left to right. | Iteration |
| Binary Tree Morris | Morris traversal is an in-order traversal algorithm for binary trees with O(1) space complexity. It allows tree traversal without additional stack or recursion. | Iteration |
| Principle | Description |
|---|---|
| Practicality | Follows ES6 and ESNext standards, offering unified and considerate optional parameters, and simplifies method names. |
| Extensibility | Adheres to OOP (Object-Oriented Programming) principles, allowing inheritance for all data structures. |
| Modularization | Includes data structure modularization and independent NPM packages. |
| Efficiency | All methods provide time and space complexity, comparable to native JS performance. |
| Maintainability | Follows open-source community development standards, complete documentation, continuous integration, and adheres to TDD (Test-Driven Development) patterns. |
| Testability | Automated and customized unit testing, performance testing, and integration testing. |
| Portability | Plans for porting to Java, Python, and C++, currently achieved to 80%. |
| Reusability | Fully decoupled, minimized side effects, and adheres to OOP. |
| Security | Carefully designed security for member variables and methods. Read-write separation. Data structure software does not need to consider other security aspects. |
| Scalability | Data structure software does not involve load issues. |