COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Full
|
|
|
Empty
|
|
|
Half full
|
|
|
saturated
|
Detailed explanation-1: -Jein when head==NULL is true, it means that head is not assigned any location in the memory.. since it is a struct type, it will be assigned a reference. Through that reference you can access its data or values. So null means not have any reference or memory.
Detailed explanation-2: -The entry point into a linked list is called the head of the list. It should be noted that head is not a separate node, but the reference to the first node. If the list is empty then the head is a null reference. A linked list is a dynamic data structure.
Detailed explanation-3: -The the head is null, it is also the tail and would also be null. If the list is empty, the tail of the list (address-wise) is equal to the head of the list. If you know the list has a tail is will also have a head.
Detailed explanation-4: -=> *start=NULL; means you are utilizing a memory space to point to nothing which can be used to point a structure of type node.
Detailed explanation-5: -A linked list is held using a local pointer variable which points to the first item of the list. If that pointer is also NULL, then the list is considered to be empty.