31-07-2012, 10:52 AM
LINKED LIST CSE 205 DATA STRUCTURES
CSE 205.doc (Size: 133 KB / Downloads: 30)
INTRODUCTION
A linked list is a complex data structure especially useful in systems or applications programming.A linked list or one way list is a linear collection of data elements called nodes, where the linear order is given by the means of pointers. That is each node is divided into two parts the first part contain the information of the element, and the second part called the linked field or next pointer field, contain the address of the next node in the list.
WHY LINKED LISTS?
The principal benefit of a linked list over a conventional array is that the list elements can easily be inserted or removed without reallocation or reorganization of the entire structure because the data items need not be stored contiguously in memory or on disk. Linked lists allow insertion and removal of nodes at any point in the list, and can do so with a constant number of operations if the link previous to the link being added or removed is maintained during list traversal.
OBJECTIVE OF PROJECT:
Implementation of singly linked list with insertion, deletion and searching and show output using graphics.
BRIEF DESCRIPTION
In my source code a structure is declared in which there is one ‘int’ variable and one pointer variable of struct which are passed as arguments to different functions. For the insertion, deletion , searching ,displaying there are different functions which are called in the switch statement depending upon the input by user.