What additional pointer does a node in a doubly linked list have compared to a node in a singly linked list?a.A pointer to the next nodeb.A pointer to the head nodec.A pointer to the tail noded.A pointer to the middle nodee.A pointer to the previous node

Which of the following is true for a doubly linked list compared to a singly linked list?It consumes less memory.It allows traversal in both forward and backward directions.It does not use pointers.It has faster insertion and deletion at the end.

In a doubly linked list, what’s the “tail” of a linked list?It’s the node with the pointer to the previous node equal to NULLIt’s the node with the pointer to the next node equal to NULL

In a doubly linked list, what’s the “head” of a linked list?It’s the node with the pointer to the previous node equals to NULLIt’s the node with the pointer to the next node equals to NULLI don't know

How many pointers does each node in a doubly linked list have?NoneOneTwoThree

How is the last node identified in a doubly linked list?It points to `None`.It has a special flag.It has a reference to the first node.It has a pointer to the previous node.