Chapter23–DataStructures.pptVIP

Chapter 23 – Data Structures 23.1 Introduction Dynamic data structures Grow and shrink at execution time Linked Lists: “Lined up in a row” Insertions and removals can occur anywhere in the list Stacks: Insertions and removals only at top Push and pop Queues: Insertions made at back, removals from front Binary Trees: Facilitate high-speed searching and sorting of data Efficient elimination of duplicate items 23.2 Self-Referential Classes Self-Referential Class Contains a reference member to an object of the same class type E.g.: class Node { private int data; private Node