Write a C code that will search an int type target from a dynamic linked list. The linked list contains int type values inside each of the nodes. The “search” function will use following input-output arguments, Input: Pointer to the head of the list that you are searching Target value that you are searching Output: Pointer to the node that contains the target if found or, NULL if not found.
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Write a C code that will search an int type target from a dynamic linked list. The
linked list contains int type values inside each of the nodes. The “search” function
will use following input-output arguments,
Input:
Pointer to the head of the list that you are searching
Target value that you are searching
Output:
Pointer to the node that contains the target if found or, NULL if not found.
Step by step
Solved in 3 steps with 1 images
