feat: Trie data structure using hashmap, predict_words method, class Trie (#1464)

* feat: add Trie data structure using hashmap, predict_words method, class Trie

* updating DIRECTORY.md

* fix: fixed clang.tidy warnings

* docs: added documentation toclass trie

* docs: updated documentation

* fix: added namespace trie_using_hashmap

* docs: updated documentation with comments

* docs: updated documentation with spelling corrections

* docs: updated requested changes

* docs : updated requested changes in documentation

* fix: Apply suggestions from code review

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
Venkata Bharath Malapati
2021-03-18 14:28:33 -04:00
committed by GitHub
parent 73ff948b0d
commit 7ea1ca6c9c
2 changed files with 346 additions and 0 deletions

View File

@@ -54,6 +54,7 @@
* [Tree 234](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/tree_234.cpp)
* [Trie Modern](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/trie_modern.cpp)
* [Trie Tree](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/trie_tree.cpp)
* [Trie Using Hashmap](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/trie_using_hashmap.cpp)
## Dynamic Programming
* [0 1 Knapsack](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/0_1_knapsack.cpp)