Data Structures in C++
-
Updated
Feb 19, 2024 - C++
Data Structures in C++
Designed this project as a Teacher Assistant for the Data Structures course.
Advance data structure includes DSU, BIT, SQRT Decomposition, Segment Tree, Lazy Propagation, Trie Tree etc.
The third assignment for AUT's Advanced Programming course (Spring 2024), focusing on the implementation and understanding of Bloom Filters and Tries. These structures optimize space and search operations, crucial for network systems and data processing.
A console based text editor that will suggest words from a Dictionary
A mini search engine implemented in C++ using trie, maxheap, hashmap and various linked lists.
A collection of sorting algorithms and data structures implemented in C++. Each algorithm and data structure comes with its own set of test cases to ensure correctness and robustness.
autocomplete text app with cpp GUI QT
C++ homework code and final project
Code done for the Data Structure class on UFSC
This program stores and manages records of employees of a Hotel. University project for the course "Data Structures". Course Code: CEID_NY233
A multilingual, blazingly fast, offline dictionary for CS163 Final Project
Implementation of various data structures
Trie is a tree-based data structure, which is used for efficient retrieval of a key in a large dataset of strings.
Implement Trie model for adding and searching words in C++
Some Important Data Structure and Algorithm Questions while preparing for Interviews. These questions are very important and most popular one so you should revise them when appearing for interviews
Data Structures and Algorithms
Лаба 4.0, ТРАЙ ДЕРЕВО, ДОБАВЛЕНИЕ, УДАЛЕНИЕ, ПРОВЕРКА НА НАЛИЧИЕ, ПЕРЕСЕЧЕНИЯ МНОЖЕСТВ, Корчагин Д., зачет, ЯМП, 2 сем, 2 к, ПМИ
Add a description, image, and links to the trie-tree topic page so that developers can more easily learn about it.
To associate your repository with the trie-tree topic, visit your repo's landing page and select "manage topics."