Linked List

A linear dynamic data structure to store data items is called

• Linked list

• Stack

• Tree

• Queue

Linked list elements are at contiguous location

• No

• Yes

There are several types of linked list

• All of the above

• Singly

• Doubly

• Circular

Singly linked list has ... parts

• 2

• 3

• 1

• More than 3

Linked list has the form like

• Chain

• Wagons

• Bracelet

• Necklace

An item in linked list is called

• Node

• Head

• Tail

• Pointer

The first and last node is called

• Head and tail

• Head and leg

• Eye and tail

• Eye and leg

Node contains two things

• Data and pointer

• Direction and pointer

• Reference and pointer

• Direction and address

The difference between arrays and linked list

• All of the above

• Linked list does not store data in contiguous memory locations

• Linked list does not have a size limit

• Linked list does not waste memory space

How to insert a new node in the beginning of the linked list

• Head -> new node, new node -> previous node

• Previous node -> new node, new node -> next node

• Previous tail -> new node, new node -> null

• Head ->  previous node, previous node -> new node