Skip to content

daut/trie-js

Repository files navigation

Trie.ts

Trie data structure implementation in TypeScript.

Usage

Create new Trie

import { Trie } from 'trie-js';

const trie = new Trie();

Insert element

trie.insert('Tree');

Search for an element

trie.search('Tree'); // Returns: true

Check if prefix exists

trie.startsWith('Tr'); // Returns: true
trie.startsWith('Xyz'); // Returns: false

Get node by word/prefix

const node = trie.getNode('Tre'); // Returns: TrieNode | null

Build

Run npm run build to build project.

About

Trie data structure, implemented in TypeScript

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published