3. (a) (b) How is a doubly linked list more useful than a singly linked list? Write a program/pseudo code to add an element after a given element in a doubly linked list. Why is a Linked List called a self-referential data type? Represent the polynomial 6x5 + 10x² + x + 5 using a Linked List.
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).
want 3rd answer only
Step by step
Solved in 3 steps with 3 images
