Timeline for AVL Tree or HashTable for storing relatively big data?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 16, 2017 at 12:44 | vote | accept | Reboot | ||
| Oct 16, 2017 at 6:04 | comment | added | Evil | I encourage you to post separate question with exact task you have, constraints and expected sizes of data. Also if you could, please delete obsolete comments. | |
| Oct 16, 2017 at 5:58 | answer | added | Evil | timeline score: 2 | |
| Oct 16, 2017 at 5:49 | comment | added | Pseudonym♦ | I agree with @Evil here. You have two interesting data structure problems: representing a graph, and efficiently managing labels on the vertices and/or edges. | |
| Oct 16, 2017 at 5:30 | comment | added | Reboot | I have included the changes in my question, to make to clear to understand. Thanks! | |
| Oct 16, 2017 at 5:29 | history | edited | Reboot | CC BY-SA 3.0 |
added 400 characters in body; edited title
|
| Oct 16, 2017 at 5:23 | comment | added | Evil | It changes your question, quite a bit. Maybe you are taking the wrong approach, I would encourage you to edit the question and include exact task, because it seems that you would benefit from using graph (it seems that there are some traversals and path finding involved) and second structure, a hash table pointing to streets / stops etc. | |
| Oct 16, 2017 at 5:16 | comment | added | Reboot | Data grow with time means if I add more objects later. Bus -> street1 -street2- street3- destination, so search would be like return the route bus1 took to reach destination5. | |
| Oct 16, 2017 at 4:07 | history | asked | Reboot | CC BY-SA 3.0 |