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 --save
yarn add tree-multimap-typed
API docs & Examples
Standard library data structure comparison
|Data Structure Typed
|time taken (ms)
|executions per sec
|100,000 add & delete randomly
Built-in classic algorithms
|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.
|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.
Software Engineering Design Standards
|Follows ES6 and ESNext standards, offering unified and considerate optional parameters, and simplifies method names.
|Adheres to OOP (Object-Oriented Programming) principles, allowing inheritance for all data structures.
|Includes data structure modularization and independent NPM packages.
|All methods provide time and space complexity, comparable to native JS performance.
|Follows open-source community development standards, complete documentation, continuous integration, and adheres to TDD (Test-Driven Development) patterns.
|Automated and customized unit testing, performance testing, and integration testing.
|Plans for porting to Java, Python, and C++, currently achieved to 80%.
|Fully decoupled, minimized side effects, and adheres to OOP.
|Carefully designed security for member variables and methods. Read-write separation. Data structure software does not need to consider other security aspects.
|Data structure software does not involve load issues.