https://github.com/saadhaniftaj/triefunctions-cpp

Trie data structure implementation in C++ for efficient word insertion, search, and prefix-based retrieval. Ideal for applications like autocomplete and spell-check
https://github.com/saadhaniftaj/triefunctions-cpp

cpp dsa trie-data-structure

Last synced: over 1 year ago
JSON representation

Trie data structure implementation in C++ for efficient word insertion, search, and prefix-based retrieval. Ideal for applications like autocomplete and spell-check

• Host: GitHub
• URL: https://github.com/saadhaniftaj/triefunctions-cpp
• Owner: saadhaniftaj
• Created: 2024-11-07T18:39:29.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2024-11-08T21:23:23.000Z (over 1 year ago)
• Last Synced: 2024-11-08T22:25:43.084Z (over 1 year ago)
• Topics: cpp, dsa, trie-data-structure
• Language: C++
• Homepage:
• Size: 1.95 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Trie Data Structure Implementation in C++

## Overview

This project implements a Trie data structure in C++ for efficient string storage and retrieval, especially useful for prefix-based searches. Tries are tree-like data structures, commonly used in applications like autocomplete and spell check.

## Features

- **Insert Words**: Efficiently adds words to the Trie.

- **Search Words**: Checks if a word exists in the Trie.

- **Prefix Search**: Finds all words with a given prefix, making it ideal for autocomplete functionalities.

## File Structure

- **Trie.cpp**: Contains the main implementation code for the Trie data structure, including `insert`, `search`, and `words_with_prefix` methods.

## How to Run

1. Clone or download this repository.

2. Compile the C++ file with a command like:

   ```bash

   g++ Trie.cpp -o Trie