Linked List

Name the three functions of a stack data structure.

• push, pop, peek

• push, pop, pull

• push, pop, pow

• none of the above

How many fields does the node of a singly linked list has?

• 1

• 2

• 3

• 4

Circular Linked List the Address part of last node holds the address of

• First Node

• Null

• Intermediate Node

• None of the Above

Doubly Linked List Consists of

• 1-Data , 1- Address

• 2-Data , 1- Address

• 1-Data , 0- Address

• 1-Data , 2- Address

Node consists of

• Address and Pointer

• Data

• Data and Address

• Pointer and Address

Linked list is a collection of

• Nodes

• Arrays

• Address

• None