Timeline for Trie (dictionary tree) data structure implementation: insertWord, printAllWords, searchPrefix, deleteWord, deleteTrie
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S May 26, 2020 at 22:05 | history | bounty ended | Community Bot | ||
| S May 26, 2020 at 22:05 | history | notice removed | Community Bot | ||
| May 19, 2020 at 16:39 | vote | accept | user_185051 | ||
| May 18, 2020 at 22:20 | answer | added | Emma X | timeline score: 5 | |
| S May 18, 2020 at 20:29 | history | bounty started | user_185051 | ||
| S May 18, 2020 at 20:29 | history | notice added | user_185051 | Draw attention | |
| Nov 19, 2018 at 22:26 | comment | added | user_185051 |
All the DFS (depth first search) function are basically the recursive functions to go down the tree and do something to each node. For example, deleteTrieDFS traverses each node's children recursively until the node doesn't have children - then the node is deleted (set to nullptr). Does it make sense?
|
|
| Nov 19, 2018 at 22:19 | comment | added | Calak |
Can you give more explanation about all of these xxxxDFS functions please?
|
|
| Nov 19, 2018 at 21:00 | history | tweeted | twitter.com/StackCodeReview/status/1064624357354479624 | ||
| Nov 19, 2018 at 20:37 | history | edited | 200_success |
edited tags
|
|
| Nov 19, 2018 at 19:05 | review | First posts | |||
| Nov 19, 2018 at 19:42 | |||||
| Nov 19, 2018 at 19:01 | history | asked | user_185051 | CC BY-SA 4.0 |