Skip to content

ziaddevv/Auto_Complete_Trie_Tree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

Dictionary System - Auto-Complete with Trie

Overview

This project is an interactive command-line application that implements an Auto-Complete Search feature using the Trie (Prefix Tree) data structure.
It works as a dictionary system that provides fast word suggestions as the user types a prefix.

Features

  • Insert and delete words
  • Search for words
  • Find words with a given prefix
  • Auto-complete suggestions
  • Add or update word definitions
  • View word and system statistics
  • Track most frequent words
  • Import and export dictionary to a file
  • Find anagrams

Tech Stack

  • Language: C++
  • Data Structure: Trie (Prefix Tree)
  • Concepts: Recursion, Hashing, File I/O, Frequency Counting

Usage

When you run the program, you will see a menu:

About

This project is an interactive command-line application that implements an Auto-Complete Search feature using the Trie (Prefix Tree) data structure. It provides fast word suggestions as the user types a prefix, similar to search engines and text editors.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages