types of linked list

  • Singly Linked List : Singly linked lists contain nodes which have a data part as well as an address part i.e. next, which points to the next node in sequence of nodes. The operations we can perform on singly linked lists are insertion, deletion and traversal.
    Linear Linked List
  • Doubly Linked List : In a doubly linked list, each node contains two links the first link points to the previous node and the next link points to the next node in the sequence.
    Double Linked List
  • Circular Linked List : In the circular linked list the last node of the list contains the address of the first node and forms a circular chain.
    Circular Linked List

1 comment:

  1. Hello There,


    The challenge however, is we don’t yet know how it will be used making too hard to assess their value proposition and consequently value.

    We are a technology company in South Africa with a few power electronic products containing micros with custom written software in C. We are trying now as non software engineers, with basic understanding of C to try and understand or interpret our software into basic english if I may put it that way. We are the hardware engineers and designed the unit but did not write the software ourselves.

    if I posted sections of code, would someone be able to translate this for us and also write new improved modifications that we require

    But nice Article Mate! Great Information! Keep up the good work!


    Many Thanks,
    Anie

    ReplyDelete