Skip to main content
Home
Browse packagesDocs
Sign In with GitHubSign In with GitLab

@std/data-structures@0.215.0

latest
Works with
It is unknown whether this package works with Browsers, Deno, Node.js, Cloudflare Workers, Bun
It is unknown whether this package works with Browsers
It is unknown whether this package works with Deno
It is unknown whether this package works with Node.js
It is unknown whether this package works with Cloudflare Workers
It is unknown whether this package works with Bun
•JSR Score58%•
Published2 years ago (0.215.0)

Classes

c
RedBlackTree<T>(compare?: (
a: T,
b: T
) => number)

A red-black tree. This is a kind of self-balancing binary search tree. The values are in ascending order by default, using JavaScript's built-in comparison operators to sort the values.

  • from<T>(collection: ArrayLike<T> | Iterable<T> | RedBlackTree<T>): RedBlackTree<T>

    Creates a new red-black tree from an array like or iterable object.

  • insert(value: T): boolean

    Adds the value to the binary search tree if it does not already exist in it. Returns true if successful.

  • remove(value: T): boolean

    Removes node value from the binary search tree if found. Returns true if found and removed.

  • removeFixup(
    parent: RedBlackNode<T> | null,
    current: RedBlackNode<T> | null
    ): void
    No documentation available
  • root: RedBlackNode<T> | null
    No documentation available

Report package

Please provide a reason for reporting this package. We will review your report and take appropriate action.

Please review the JSR usage policy before submitting a report.

Add Package

deno add jsr:@std/data-structures

Import symbol

import * as mod from "@std/data-structures/red_black_tree";
or

Import directly with a jsr specifier

import * as mod from "jsr:@std/data-structures/red_black_tree";