Skip to main content
Lesson 31 - Linked-List Algorithms
ZIPPDF (letter)
Lesson MenuPreviousNext
  
Linked-List Algorithms page 4 of 7

  1. Searching an ordered linked list is a sequential search process. A linked list is not a random access data structure. You cannot jump to the middle of a linked list. Only sequential moves are possible. The search function could return a value or a pointer to that cell.

  2. Deleting a value involves the following steps:

    1. Locating the value (if it exists) to be deleted.

    2. Rehooking pointers around the node to be deleted.


Lesson MenuPreviousNext
Contact
 ©ICT 2003, All Rights Reserved.