Section 24.8. Wrap-Up


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 topso stacks are known as last-in, first-out (LIFO) data structures. For queues, which represent waiting lines, you saw that insertions are made at the tail and deletions are made from the headso queues are known as first-in, first-out (FIFO) data structures. We also presented the binary tree data structure. You saw a binary search tree that facilitated high-speed searching and sorting of data and efficient duplicate elimination. Finally, we presented a version of the binary tree data structure that processes IComparable objects and uses the CompareTo method to help determine where the object should be placed in the binary tree. In the next chapter, we introduce generics, a capability which allows you to declare a family of classes and methods that implement the same functionality on any type.



Visual BasicR 2005 for Programmers. DeitelR Developer Series
Visual Basic 2005 for Programmers (2nd Edition)
ISBN: 013225140X
EAN: 2147483647
Year: 2004
Pages: 435

flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net