npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

@dsinjs/binary-tree

v2.0.1

Published

Binary Trees for your DS in JS

Downloads

26

Readme

@dsinjs/binary-tree

Data structure in your JavaScript code, Binary Trees.

Build Status Node.js CI

Overview

Binary Tree in Javascript

      tree
      ----
       j    <-- root
     /   \
    f      k  
  /   \     \
 a     h     z    <-- leaves
  • Binary tree always has nodes with maximum children of 2.
  • Index starts with 1 such that index of j is 1, f is 2, z is 7 and so on.
  • Root is single node always on top of the tree, in this case its j.
  • Leaves nodes are the nodes who does not have any children, in this case its a, h, z.

Installation

Using npm

npm install @dsinjs/binary-tree --save

Or directly on your browser, simply download your file from the following:

<script type="application/javascript" src="dsinjs-binarytree.js"></script>
<script type="application/javascript" src="dsinjs-binarytree.min.js"></script>

Usage

const { BTreeNode, BTree } = require('@dsinjs/binary-tree');
var node = new BTreeNode({ value: 10 });
var nodel = new BTreeNode({ value: 15, lNode: node });
var tree = new BTree(10);
tree.insert(20);
tree.insert(30);
tree.delete(30);
tree.toArray(); // [{value:10,...},{value:20,...}]
// Classic ES6 iterations
for (const node of tree) {
    console.log(node.value); // 10, 20
}

All Features:

  • All Binary Tree data structure functionality.
  • 25+ Binary Tree functions.
  • Main functions like insert(), delete(), each(), find(), sort() etc.
  • Extended functions like entries(), Symbol.iterator, supports for...of loops.
  • Conversion methods like fromArray(), toArray(), toString(), toJSON().

Complete Documentation

Checkout DOCUMENTATION.md for complete documentation or View Documentation online at https://dsinjs.github.io/binary-tree/

Note: May need to use polyfills for Array.entries(), to make BTree work in older browsers like IE11.

Help us expand

Let me know in issues/github page or on email which javascript functions to include in next release. Check all the Contributing authors to this library.