Skip to main content
ICT
Lesson AB29 - Linked List
 
Main Previous Next
Title Page >  
Summary >  
Lesson A1 >  
Lesson A2 >  
Lesson A3 >  
Lesson A4 >  
Lesson A5 >  
Lesson A6 >  
Lesson A7 >  
Lesson A8 >  
Lesson A9 >  
Lesson A10 >  
Lesson A11 >  
Lesson A12 >  
Lesson A13 >  
Lesson A14 >  
Lesson A15 >  
Lesson A16 >  
Lesson A17 >  
Lesson A18 >  
Lesson A19 >  
Lesson A20 >  
Lesson A21 >  
Lesson A22 >  
Lesson AB23 >  
Lesson AB24 >  
Lesson AB25 >  
Lesson AB26 >  
Lesson AB27 >  
Lesson AB28 >  
Lesson AB29 >  
Lesson AB30 >  
Lesson AB31 >  
Lesson AB32 >  
Lesson AB33 >  
Vocabulary >  
 

E. Pitfalls of Linked Data Structures page 7 of 16

  1. A linked list must end with a null value. Without such a marker at the end of the list, a routine cannot “see” the end of the data structure. This assignment of a null value at the end of the list is often taken care of when a new node is packaged or through the use of a constructor.

  2. When a reference variable is null, it is a programming error to invoke one of its methods or to try to access one of its instance variables. For example, a program may maintain a reference to the first node of a linked list, as follows:

    ListNode first;

    Initially, the list is empty and first is the null reference. At this point, it is a programming error to invoke one of the first’s methods. The error would occur as a NullPointerException.

 

 

Main Previous Next
Contact
 © ICT 2006, All Rights Reserved.