Struct Trie

pub struct Trie {
    pub root: TrieNode,
}

A Trie data structure for managing strings.

The Trie supports efficient insertion, search, and prefix checking.

Fields

root: TrieNode

The root node of the Trie.

Implementations

impl Trie

pub fn new() -> Self

Creates a new, empty Trie.

Examples

use prefix_tree::Trie;

let trie = Trie::new();

pub fn insert(&mut self, word: &str)

Inserts a word into the Trie.

Examples

use prefix_tree::Trie;

let mut trie = Trie::new();
trie.insert("hello");
trie.insert("world");

pub fn search(&self, word: &str) -> bool

Checks if a word exists in the Trie.

Examples

use prefix_tree::Trie;

let mut trie = Trie::new();
trie.insert("hello");
assert!(trie.search("hello"));
assert!(!trie.search("hell"));

pub fn starts_with(&self, prefix: &str) -> bool

Checks if there is any word in the Trie that starts with the given prefix.

Examples

use prefix_tree::Trie;

let mut trie = Trie::new();
trie.insert("hello");
assert!(trie.starts_with("he"));
assert!(!trie.starts_with("hero"));

Trait Implementations

impl Debug for Trie

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Trie

fn default() -> Trie

Returns the “default value” for a type.