Please enable JavaScript.

Coggle requires JavaScript to display documents.

Kump 6 - Coggle Diagram

- - - - Example
        
        We can store 5 values of type int in an array without having to declare 5 different variables, each one with a different identifier. Instead of that, using an array we can store 5 different values of the same type, int for example, with a unique identifier.
  - - - 1.Insertion
        
        can be made at the beginning of the list, in the middle of the list or at the end of the list
      - 2.Deletion
        
        requires that the list be searched to locate the data being deleted
      - 3.Retrieval
        
        requires that data be located in a list and presented to the calling module without changing the contents of the list
      - 4.Traversal
        
        is a special case of retrieval in which all elements are retrieved in sequence
    - - Example, if want to create a list of 10 numbers, it can be declared as
        
        define maxSize 10 // used to declare maximum size of array
        int listNumber[maxSize];//declaration of an array
        int No0fltem;// used to store no.if item in an array
- - - - contain nodes which have a data field as well as 'next' field,
        which points to the next node in line of nodes
    - - each node contains, besides the next-node link, a second link
        field pointing to the 'previous' node in the sequence.
      - The two
        links may be called 'forward('s') and 'backwards', or 'next' and
        'prev'('previous')
    - - the link field often contains a null reference, a special value used to indicate the lack of further nodes
      - A less common convention is to make it point to the first node of the list; in that case the list is said to be 'circular' or 'circularly linked‘
    - - Doubly Circular linked list has both the properties of doubly linked list and circular linked list.
      - Two consecutive elements are linked by previous and next pointer and the last node points to first node by next pointer and also the previous pointer of the head node points to the tail node