#CS301
Subscribe my channel and get solution file from description
Solution:
According to my point of view, doubly link list is more efficient.
Doubly link list is used in navigation systems that require both forward and backward level.
On both ends, you have immediate access.
It has the ability to function as both a Queue and a stack at the same time. There are no additional pointers required for node deletion.
Reason:
Because, you already access on both ends, you may use Hill-Clumb traversal.