Struct Trie

pub struct Trie { /* private fields */ }

A Trie (prefix tree) data structure for efficient string prefix matching.

A Trie stores a set of strings in a tree structure, where each node represents a character in a string, and paths from the root to nodes marked as is_end_of_word represent complete words.

Implementations

impl Trie

pub fn new() -> Self

Creates a new, empty Trie with a root node.

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

Inserts a word into the Trie.

This method iterates over the characters of the word, creating new nodes or following existing ones as needed. The is_end_of_word flag is set to true on the last node to mark the end of the inserted word.

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

Searches for a prefix in the Trie.

Returns true if the prefix exists in the Trie, false otherwise.

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

Searches for a full word in the Trie.

Returns true if the exact word exists in the Trie, false otherwise.

Trait Implementations

impl Debug for Trie

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

Formats the value using the given formatter.