@std/data-structures@1.1.3Built and signed on GitHub ActionsBuilt and signed on GitHub Actions
Built and signed on GitHub Actions
latest
denoland/stdWorks with
•JSR Score100%•This package works with Cloudflare Workers, Node.js, Deno, Bun, Browsers




License
•MIT
Downloads43,546/wk
•Published2 weeks ago (1.1.3)
Common data structures like red-black trees and binary heaps
Data structures for use in algorithms and other data manipulation.
import { BinarySearchTree } from "@std/data-structures"; import { assertEquals } from "@std/assert"; const values = [3, 10, 13, 4, 6, 7, 1, 14]; const tree = new BinarySearchTree<number>(); values.forEach((value) => tree.insert(value)); assertEquals([...tree], [1, 3, 4, 6, 7, 10, 13, 14]); assertEquals(tree.min(), 1); assertEquals(tree.max(), 14); assertEquals(tree.find(42), null); assertEquals(tree.find(7), 7); assertEquals(tree.remove(42), false); assertEquals(tree.remove(7), true); assertEquals([...tree], [1, 3, 4, 6, 10, 13, 14]);
Built and signed on
GitHub Actions
Add Package
deno add jsr:@std/data-structures
Import symbol
import * as data_structures from "@std/data-structures";
Import directly with a jsr specifier
import * as data_structures from "jsr:@std/data-structures@^1.1.3";