| Version | Vulnerabilities | License Risk | |||
|---|---|---|---|---|---|
| 1.53.1 | | | 11/2024 |
|
| |
| 1.52.9 | | | 10/2024 |
|
| |
| 1.51.9 | | | 01/2024 |
|
| |
| 1.50.9 | | | 01/2024 |
|
| |
| 1.38.8 | | | 10/2023 |
|
| |
Scan your projects for vulnerabilities. Fix quickly with automated fixes. Get started with Snyk for free.
Get started freeThe npm package binary-tree-typed receives a total of 623 downloads a week. As such, we scored binary-tree-typed popularity level to be Limited.
Based on project statistics from the GitHub repository for the npm package binary-tree-typed, we found that it has been starred 122 times.
Downloads are calculated as moving averages for a period of the last 12 months, excluding weekends and known missing data points.
This project has seen only 10 or less contributors.
Further analysis of the maintenance status of binary-tree-typed based on released npm versions cadence, the repository activity, and other data points determined that its maintenance is Healthy.
We found that binary-tree-typed demonstrates a positive version release cadence with at least one new version released in the past 3 months.
As a healthy sign for on-going project maintenance, we found that the GitHub repository had at least 1 pull request or issue interacted with by the community.
binary-tree-typed has more than a single and default latest tag published for the npm package. This means, there may be other tags available for this package, such as next to indicate future releases, or stable to indicate stable releases.
This is a standalone Binary Tree 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 binary-tree-typed --save
yarn add binary-tree-typed
| Data Structure | Unit Test | Performance Test | API Docs |
|---|---|---|---|
| Binary Tree |  |
|
Binary Tree |
| Data Structure Typed | C++ STL | java.util | Python collections |
|---|---|---|---|
| BinaryTree<K, V> | - | - | - |
| test name | time taken (ms) | executions per sec | sample deviation |
|---|---|---|---|
| 1,000 add randomly | 12.35 | 80.99 | 7.17e-5 |
| 1,000 add & delete randomly | 15.98 | 62.58 | 7.98e-4 |
| 1,000 addMany | 10.96 | 91.27 | 0.00 |
| 1,000 get | 18.61 | 53.73 | 0.00 |
| 1,000 dfs | 164.20 | 6.09 | 0.04 |
| 1,000 bfs | 58.84 | 17.00 | 0.01 |
| 1,000 morris | 256.66 | 3.90 | 7.70e-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. |
Binary Tree. Javascript & Typescript Data Structure. Visit Snyk Advisor to see a full health score report for binary-tree-typed, including popularity, security, maintenance & community analysis.
The npm package binary-tree-typed receives a total of 623 weekly downloads. As such, binary-tree-typed popularity was classified as limited. Visit the popularity section on Snyk Advisor to see the full health analysis.
We found that binary-tree-typed demonstrated a healthy version release cadence and project activity. It has a community of 6 open source contributors collaborating on the project. See the full package health analysis to learn more about the package maintenance status.
The npm package binary-tree-typed was scanned for known vulnerabilities and missing license, and no issues were found. Thus the package was deemed as safe to use. See the full health analysis review.
Minimize your risk by selecting secure & well maintained open source packages
Scan your application to find vulnerabilities in your: source code, open source dependencies, containers and configuration files
Easily fix your code by leveraging automatically generated PRs
New vulnerabilities are discovered every day. Get notified if your application is affected