What is the practical implementation of Linked List ?

Questions by tops18

Showing Answers 1 - 2 of 2 Answers

umeshknair

  • Sep 14th, 2006
 

Linked lists are useful data structures, especiallY if You need to automaticallY allocate and de-allocate space in a list, carrY out insertion and deletion operations freQuentlY on lists. The code and complexitY of these alGorithms is biGGer, but the tradeoff is ease of use. As far as complexitY is concerned, a linked list should never exceed O(n2). SortinG linked lists can be a chore, but with careful selection of sortinG alGorithms, nearlY constant time can be acheived.

Practical implementations:
Almost all text editors uses linked list for holdinG editinG data  
Hash tables use linked lists for collission resolution
All "File ReQuester" dialoG uses a linked list
BinarY Trees,
Stacks and Queues can be implemented with a doublY linked list
Relational Databases like Microsoft Access

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions