On 26Jun2019 11:01, Mats Wichmann wrote:
On 6/26/19 4:40 AM, mhysnm1...@gmail.com wrote:
Link lists I would guess be useful in an index for a database?
I believe the "classic" use case is memory management - keeping track of
chunks of memory.
Flipping this, your typical ordered database ind
On 26/06/2019 19:46, Mats Wichmann wrote:
> I forgot to add the snide-comment part of "what are these good for":
>
> (a) binary search trees are excellent for Computer Science professors
> who want to introduce recursion into their classes.
>
> (b) all the classic data structures are candidates
On 6/26/19 11:59 AM, William Ray Wing via Tutor wrote:
> One of the most useful (to me) structures is the double-ended queue ("from
> collections import deque”). It creates a queue that can quickly remove an
> item from one end and add an item to the other. Particularly useful for
> displayin
> On Jun 26, 2019, at 6:40 AM, mhysnm1...@gmail.com wrote:
>
> All,
>
>
>
> General computer science question for data structures.
>
> When would you use the below structures and why? If you can provide a real
> life example on when they would be used in a program This would be great. I
> am
On 6/26/19 4:40 AM, mhysnm1...@gmail.com wrote:
> All,
>
>
>
> General computer science question for data structures.
>
> When would you use the below structures and why? If you can provide a real
> life example on when they would be used in a program This would be great. I
> am not after cod
On 26/06/2019 11:40, mhysnm1...@gmail.com wrote:
> When would you use the below structures and why? If you can provide a real
> life example on when they would be used in a program This would be great.
> Link lists
Link lists are very flexible and ideal for when you have a varying
amount of dat
