https://github.com/faranak-cs/digital-dictionary

A digital dictionary using Data Structures i.e., AVL and Trie Trees
https://github.com/faranak-cs/digital-dictionary

algorithms-and-data-structures avl-tree-implementations dictionary trie-tree

Last synced: 1 day ago
JSON representation

A digital dictionary using Data Structures i.e., AVL and Trie Trees

• Host: GitHub
• URL: https://github.com/faranak-cs/digital-dictionary
• Owner: faranak-cs
• Created: 2022-12-04T11:22:45.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2024-02-05T21:09:59.000Z (9 months ago)
• Last Synced: 2024-02-05T22:28:25.321Z (9 months ago)
• Topics: algorithms-and-data-structures, avl-tree-implementations, dictionary, trie-tree
• Language: C++
• Homepage:
• Size: 5.67 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
 # A digital dictionary via AVL & Trie trees

 This is a C++ console based project that allows the user to search a word just like an online dictionary. Application will return its meaning (synonym), part of speech, and history of word (if any). The user can compare between the Data Structures used (AVL Tree, Trie Tree) which is faster.

 # Setup

 * Add .cpp , .h , and .csv files in one directory.

 * Create a project in Microsoft Visual Studio and install C++ libraries.

 * Build the project and run the .cpp file.