Halfway through part 1 of the ruby data structure and algorithm project Currently trying to create a breadth-first-search and a depth first search algorithm.
I’m wondering since we must create a queue via arrays as a helper to the the breadth-first-search method, arrays in ruby have no size limit, so should we even bother with pointer functions for queues? I suppose the same would apply to stacks as well. Should we create pointers just for the sake of practice?
Any feedback appreciated.