Visual Basic 2005 for Programmers: Deitel Developer Series, Second Edition

24.8. Wrap-Up

In this chapter, you learned that primitive types are value-type Structures, but can still be used anywhere Objects are expected in a program due to boxing and unboxing conversions. You learned that linked lists are collections of data items that are “linked together in a chain” and that a program can perform insertions and deletions anywhere in a linked list (though our implementation only performed insertions and deletions at the ends of the list). We demonstrated that the stack and queue data structures can be implemented as constrained versions of lists. For stacks, you saw that insertions and deletions are made only at the top—so stacks are known as last-in, first-out (LIFO) data structures. For queues, which represent waiting ...