sonic-forest
Version:
High-performance (binary) tree and sorted map implementation (AVL, Splay, Radix, Red-Black)
9 lines (8 loc) • 599 B
TypeScript
import { print } from '../util/print';
import type { Comparator } from '../types';
import type { IRbTreeNode, RbHeadlessNode } from './types';
export { print };
export declare const insert: <K, N extends IRbTreeNode<K>>(root: N | undefined, n: N, comparator: Comparator<K>) => N;
export declare const insertRight: (root: RbHeadlessNode, n: RbHeadlessNode, p: RbHeadlessNode) => RbHeadlessNode;
export declare const insertLeft: (root: RbHeadlessNode, n: RbHeadlessNode, p: RbHeadlessNode) => RbHeadlessNode;
export declare const remove: <K, N extends IRbTreeNode<K>>(root: N, n: N) => N | undefined;