By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
455,903 Members | 1,090 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 455,903 IT Pros & Developers. It's quick & easy.

data structures (fundamental operations on linked list)

P: 65
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?
May 24 '07 #1
Share this Question
Share on Google+
1 Reply


Expert 100+
P: 102
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.
May 24 '07 #2

Post your reply

Sign in to post your reply or Sign up for a free account.