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

@vanillas/binary-search-tree

v1.3.1

Published

An implementation of a binary search tree API in JavaScript

Downloads

16

Readme

Binary Search Tree

An implementation of a binary search tree API in JavaScript

Install

npm install @vanillas/binary-search-tree

Usage

Given a tree strucutre which looks like this:

  100
  / \
 20 500
 / \
10 30
    \
    40

Create the root node and insert several child nodes:


const createNode = require("@vanillas/binary-search-tree")

const rootNode = createNode(100)

rootNode
  .insert(20)
  .insert(500)

rootNode
  .left
  .insert(10)
  .insert(30)

rootNode
  .left
  .right
  .insert(40)

Now you can search easily:

rootNode.search(40)

// {
//   value: 40,
//   left: undefined,
//   right: undefined
// }

rootNode.search(20)

// {
//   value: 20,
//   left: {
//     value: [Getter],
//     left: [Getter],
//     right: [Getter],
//     toList: [Function: toList],
//     isValid: [Function: isValid],
//     insert: [Function: insert],
//     search: [Function: search]
//   },
//   right: {
//     value: [Getter],
//     left: [Getter],
//     right: [Getter],
//     toList: [Function: toList],
//     isValid: [Function: isValid],
//     insert: [Function: insert],
//     search: [Function: search]
//   }
// }

This achieves a hierarchically layered tree which looks like this:

rootNode.toList()

// [
//   [100],
//   [20, 500],
//   [10, 30],
//   [40]
// ]

Alternatively, you can utilize the optional 2nd param to the .insert() method to chain onto that new node you're inserting:

const createNode = require("@vanillas/binary-search-tree")

const rootNode = createNode(100)
  .insert(20, n20 => n20
      .insert(10)
      .insert(30, n30 => n30.insert(40))
  )
  .insert(500)

And while you can add nodes directly to the exact locations you want them, you can also allow them to be placed automatically.

const rootNode = createNode(100)
    .insert(20)
    .insert(500)
    .insert(10)
    .insert(30)
    .insert(40)

Which achieves the same layering as the other two (manual) examples listed earlier:

rootNode.toList()

// [
//   [100],
//   [20, 500],
//   [10, 30],
//   [40]
// ]

TypeScript support

Also works with TypeScript:

import { createNode } from "@vanillas/binary-search-tree"

const rootNode = createNode(100)
    .insert(20, n20 => n20
        .insert(10)
        .insert(30, n30 => n30.insert(40))
    )
    .insert(500)

const result = rootNode.search(40)