data structures (fundamental operations on linked list)

[stmfc]

what are the fundamental operations that
1- a list structure should support ?
2- a single linked list structure support ?

i am asking only the operations which are must for these
data structures.

for example supporting pop and push functions is enough for a data structure to say that it is a stack. (may be it is more than a stack, but we know that we can use it at least as a stack)
what is the situation for list and single linked list?

[pradeep kaltari]

what are the fundamental operations that
1- a list structure should support ?
2- a single linked list structure support ?

i am asking only the operations which are must for these
data structures.

for example supporting pop and push functions is enough for a data structure to say that it is a stack. (may be it is more than a stack, but we know that we can use it at least as a stack)
what is the situation for list and single linked list?

Hi,
The most basic operations for both 1 and 2 may be:
Inserting a new node in the begining/end of the list, deleting first/last node (or intermidiate node with some key specified), searching for a given node, displaying the nodes in the list.

Regards,
Pradeep.