JSPM

binary-tree-typed

1.53.3
  • ESM via JSPM
  • ES Module Entrypoint
  • Export Map
  • Keywords
  • License
  • Repository URL
  • TypeScript Types
  • README
  • Created
  • Published
  • Downloads 578
  • Score
    100M100P100Q88677F
  • License MIT

Binary Tree. Javascript & Typescript Data Structure.

Package Exports

  • binary-tree-typed
  • binary-tree-typed/dist/index.js

This package does not declare an exports field, so the exports above have been automatically detected and optimized by JSPM instead. If any package subpath is missing, it is recommended to post an issue to the original package (binary-tree-typed) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.

Readme

NPM GitHub top language npm eslint npm bundle size npm bundle size npm

What

Brief

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

How

install

npm

npm i binary-tree-typed --save

yarn

yarn add binary-tree-typed

methods

snippet

TS

JS
API docs & Examples
API Docs


Live Examples


Examples Repository


Data Structures




Data Structure
Unit Test
Performance Test
API Docs






Binary Tree


Binary Tree







Standard library data structure comparison

  
  

    Data Structure Typed
    C++ STL
    java.util
    Python collections
  

  
  

  

    BinaryTree<K, V>
    -
    -
    -
  


  




Benchmark

      
binary-tree

      
test nametime taken (ms)executions per secsample deviation
1,000 add randomly12.3580.997.17e-5
1,000 add & delete randomly15.9862.587.98e-4
1,000 addMany10.9691.270.00
1,000 get18.6153.730.00
1,000 dfs164.206.090.04
1,000 bfs58.8417.000.01
1,000 morris256.663.907.70e-4

    



Built-in classic algorithms

  
  

    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
  

  




Software Engineering Design Standards

    

        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.