Implement a Queue data structure. In our case, it may be most efficient to implement a LIFO queue, i.e. a stack and using the JS Array data structure as backing store.
This data structure will contain a set of task id's, which are identifiers of rows in the tasks database
Implement a Queue data structure. In our case, it may be most efficient to implement a LIFO queue, i.e. a stack and using the JS
Arraydata structure as backing store.This data structure will contain a set of task id's, which are identifiers of rows in the
tasksdatabase