If we were to compare Queue ADT 's append() and serve() method operations implemented using linked nodes vs using array, which one is more efficient in terms of worst-case time complexity of their operations?

Question

If we were to compare  Queue ADT 's  append()  and  serve()  method operations implemented using linked nodes vs using array, which one is more efficient in terms of worst-case time complexity of their operations?

Answer

Depends if it's a Circular Queue or Linear Queue

Answer

Array based

Answer

Both have constant time complexity for the two operations.

Answer

Linked nodes

Crowdly

If we were to compare Queue ADT 's append() and serve() method operations i...

Want instant access to all verified answers on learning.monash.edu?