Which of the following operations is performed more efficiently by a doubly linked list implementation than by singly linked list?
Both can quickly remove the current node.
Both must do search sequentially.
Both must traverse a list sequentially.
The key difference between the singly and doubly linked list impleentations is that the doubly linked list can easily reach the previous node.