Chapter 13.1, Problem 7STE

Program Plan Intro

Linked list:

• Linked list denotes a linear data structure.
• The elements are not stored at contiguous locations; the elements are linked using pointers.
• It stores linear data of similar types not like arrays.
• The size of linked list can be changed based on requirement.
• It is represented by a pointer to first linked list node.
• The first node denotes a head.
• If linked list is empty, value of head is NULL.
• The node in a list has two parts, data and pointer to next node.

Given code:

//Define a structure

struct Node

{

//Define member

double data;

//Define next node

Node *next;

};

//Define instance of Node

typedef Node* Pointer;

//Create instance

Pointer p1, p2;

Explanation:

• The “Node” defines a structure with “data” as member.
• It has a pointer “next” to next element of list.
• The “Node *Pointer” creates an instance of structure.
• The “Pointer p1, p2” creates instance variables “p1” and “p2” of type “Pointer”.