Linked lists


Published on

Useful for both UG and PG students

    Are you sure you want to  Yes  No
    Your message goes here
  • Thank you.. I am going to use your presentation here with some modifications.
    Are you sure you want to  Yes  No
    Your message goes here
No Downloads
Total views
On SlideShare
From Embeds
Number of Embeds
Embeds 0
No embeds

No notes for slide

Linked lists

  1. 1. Dr. C. Saritha Lecturer in ElectronicsSSBN Degree & PG College ANANTAPUR
  2. 2.  Data structure:-A data structure is a logical representation of data and operation that can be performed on the data. 1)linear data structure 2)Non linear data structure Linear data structure is an order of data elements. They are arrays, stacks, queues, and linked lists.
  3. 3. Linked list :- linked list is a linear data structure. It contains nodes. Each node contains two parts, i.e. DATA part and LINK part. The data contains elements and Link contains address of another node.
  4. 4.  Arrays are simple to understand and elements of an array are easily accessible But arrays have some limitations. Arrays have a fixed dimension. Once the size of an array is decided it can not be increased or decreased during education.
  5. 5.  Array elements are always stored in contiguous memory locations. Operations like insertion or deletion of the array are pretty tedious. To over come this limitations we use linked list.
  6. 6.  Linked list is a collection of elements called nodes. Each node contains two parts. they are data part and link part. Node data link
  7. 7. 14 100 30 400 42 N200 100 400• The above figure shows the example of marks obtained by different students can be stored in a linked list• Here N-stands for NULL.• Null indicates the end of the node.
  8. 8. The basic operations on linked lists are1. Creation2. Insertion3. Deletion4. Traversing5. Searching6. Concatenation7. Display
  9. 9. • The creation operation is used to create a linked list.• Insertion operation is used to insert a new node in the linked list at the specified position. A new node may be inserted at the beginning of a linked list , at the end of the linked list , at the specified position in a linked list. If the list itself is empty , then the new node is inserted as a first node.
  10. 10. • Deletion operation is used to delete on item from the linked list. It may be deleted from the beginning of a linked list , specified position in the list.• Traversing operation is a process of going through all the nodes of a linked list from one end to the another end. If we start traversing from the very first node towards the last node , It is called forward traversing.
  11. 11. • If the traversal start from the last node towards the first node , it is called back word traversing.• Searching operation is a process of accessing the desired node in the list. We start searching node –by-node and compare the data of the node with the key.
  12. 12. • Concatenation operation is the process of appending the second list to the end of the first list. When we concatenate two lists , the resultant list becomes larger in size.• The display operation is used to print each and every node’s information.
  13. 13. 1. Single linked list2. Double linked list3. Circular linked list4. Circular double linked list
  14. 14. SINGLE LINKED LIST :-• A single linked list is one in which all nodes are linked together in some sequential manner.• CIRCULAR LINKED LIST :-• A circular linked list is one which has no beginning and no ending. The null pointer in the last node of a linked list is replaced with the address of its first node such a list is called circular linked list.
  15. 15. SINGLE LINKED LIST :500 45 100 60 200 35 NStartCIRCULAR LINKED LIST:- 45 100 60 200 35 400400 100 200
  16. 16. Inserting a new node :Before inserting:14 100 35 200 20 N400 100 200After inserting: 30 100 35 200 20 N75 400 400 100 200400
  17. 17. Delete a node from the list:before deletion:35 400 48 300 46 500 30 N200 400 300 500after deletion :35 300 46 500 30 N200 300 500
  18. 18.  In circular linked list we have three functions. They are• addcirq( )• delcirq( )• cirq_display( )
  19. 19. addcirq( ) :- This function accepts three parameters. First parameter receives the address of the first node. The second parameter receives the address of the pointer to the last node.
  20. 20. Delcirq( ) :- This function receives two parameters. The first parameter is the pointer to the front node. The second is the pointer to the rear.10 front 17 16rear 5
  21. 21. DOUBLE LINKED LIST :- A single linked list has some disadvantages• That it can traverse it in one direction.• Many applications require searching backword and forword travelling sections of a list
  22. 22. • A two way list is a linear collection of data elements called nodes.• When each node is divided into three parts. They are two link parts and one data part. node prev data next
  23. 23. Inserting a new node :Before insertion:-N 11 100 200 20 400 100 40 N 200 100 400After insertion:- 100 40 NN 11 100 200 20 400 400 25 100
  24. 24. Delete a node from the list:Before deletion:-N 5 200 600 11 400 200 4 N 600 200 400After deletion:- N 11 400 200 4 N 200 400
  25. 25. REVERSING THE LINKS : Reversing means the last node becomes the first node and the first becomes the last.5 23 3 17 N5 23 3 1717 3 23 5 N
  26. 26. MERGING OF LINKED LIST :• suppose we have two linked lists.• That are pointed to two independent pointers. We have to merge the two links into a third list.• By using this merge ( ) to ensure that those elements which are common to both the lists occur only once in the third list.
  27. 27. 9 12 14 N 12 17 24 N9 12 14 17 24 N
  28. 28. SORTING OF A LINKED LIST :• Sorting means to arrange the elements either in ascending or descending order.• To sort the elements of a linked list we use any of the standard sorting algorithms for carrying out the sorting.• While performing the sorting, when it is time to exchange two elements, we can adopt any of the following two strategies.
  29. 29. 1)Exchange the data part of the two nodes, keeping the links intact. 2 8 4 3 N 2 3 4 8 N
  30. 30. 2) Keep the data in the nodes intact. Simply readjust the links such that effectively the order of the nodes changes2 400 8 500 4 600 11 N200 400 500 6002 500 8 600 4 400 11 N200 400 500 600
  31. 31. RECURSIVE OPERATIONS ON LINKED LIST : A function called by itself known as recursion. If a statement within the body of a function calls the same function. Some of the operations that are carried out on linked list can be easily implemented using recursion.
  32. 32.  For example finding out the number of nodes present in a linked list, comparing two lists, copying one linked list into another, adding a new node at the end of the linked list, etc.,
  33. 33.  We can dynamically allocate memory space as needed We can release the unused space in the situation where the allocated space seems to be more. Operation related to data elements like insertions or deletion are more simplified.
  34. 34.  Operation like insertion or deletion are less time consuming. Linked lists provide flexibility in allowing the items to be arranged efficiently.
  35. 35.  When ever we deal with fixed length lists it would be better to use an array rather than linked list. Linked list will consume more storage space than an array with same number of items this is because each item has an addition link field
  36. 36.  Linked lists are used in many other data structures. Linked lists are used in polynomial manipulation. Representation of trees, stacks, queues. etc.,
  37. 37. THANK YOU