Node structure of singly linked list
template <class T>
class node
{
T data;
node *link;
friend class sll;
};
No
|
Field (or) data member
|
Meaning
|
1
|
data
|
Value of the linked list node, it may be integer, float or character
|
2
|
link
|
It is a pointer which stores the address of next node.
|
Circular Linked List
Some terminology of Linked List programs
No comments:
Post a Comment