Select between a singly linked list and a doubly linked list based on their asymptotic

running time efficiency.

If you want to perform an

add $($e$)$ operation that

takes a value e as input and

inserts a node with value e

right before tail of the list,

which data structure would

you choose?

If you want to perform a

remove $($e$)$ operation that

takes a value e as input and

removes a node with value

It is more efficient to use singly

linked list

e from the list if present,

which data structure would

you choose?