TCS NQT Linked List Quiz – 1

With the help of linked list we can implement all these data structures.

stack and queue both are the application of the linked list.

In linked list the size is automatically increase when we perform insertion and size is automatically reduced when the element is deleted.

In linked list there are two field first carries data and second carries link of another node.

In the circular link list there are no end of the list , so that the last node of the list holds the address of the head

in the linked  list we can perform any operation with less time and the size of the link list will give at the run time.

this is the syntax for the memory allocation.

for the linked list dynamic memory will be assigned at the run time

First node should be considered the top.

In link list there are two fields , first field carries data and another carries link of the next node.