c++ cpphtp4_PPT_17.pptVIP

Chapter 17 - Data Structures 17.1 Introduction Fixed-size data structures Arrays, structs Dynamic data structures Grow and shrink as program runs Linked lists Insert/remove items anywhere Stacks Insert/remove from top of stack Queues Like a line, insert at back, remove from front Binary trees High-speed searching/sorting of data 17.2 Self-Referential Classes Self-referential class Has pointer to object of same class Link together to form useful data structures Lists, stacks, queues, trees Terminated with NULL pointer 17.2 Self-Referential Classes Sample code class Node { public: Node( int ); void setData( int ); int getData() const;  void setNextPtr( Node * ); const Node *getNextPtr() const;private: int data; Node *nextPtr;}; Pointer to object called a link nextPtr points to a Node 17.3 Dynamic Memory Allocation and Data Structures Dynamic memory allocation Obtain and release memory during program execution Create and remove nodes Operator new Takes type of object to create Returns pointer to newly created object Node *newPtr = new Node( 10 ); Returns bad_alloc if not enough memory 10 is the nodes object data 17.3 Dynamic Memory Allocation and Data Structures Operator delete delete newPtr; Deallocates memory allocated by new, calls destructor Memory returned to system, can be used in future newPtr not deleted, only the space it points to 17.4 Linked Lists Linked list Collection of self-referential class objects (nodes) connected by pointers (links) Accessed using pointer to first node of list Subsequent nodes accessed using the links in each node Link in last node is null (zero) Indicates end of list Data stored dynamically Nodes created as necessary Node can have data of any type 17.4 Linked Lists 17.4 Linked Lists Linked lists vs. arrays Arrays can become full Allocating extra space in array wasteful, may never be used Linked lists can grow/shrink as needed Linked lists only become full when system runs out of memory