C++ Saumyendra Sengupta Carl Phillip Korobkin. Object-Oriented Data Structures BJJL

Transcription

1 Saumyendra Sengupta Carl Phillip Korobkin C++ Object-Oriented Data Structures With 165 Illustrations Diskette Included Taehnische Hochschule Darmstadt FACHBERE5CH IKFORMATIK BJJL Inventar-Nr.: Sachgebiete: Standort: O T H E K Springer- Verlag New York Berlin Heidelberg London Paris Tokyo Hong Kong Barcelona Budapest

2 Preface vii 1 Concepts of Function-Oriented and Object-Oriented Data Structures Data Types, Data Objects, and Related Terminologies Definition of Abstract Data Structures Object-Oriented Design and the ADT Function-Oriented Data Structures Object-Oriented Data Structures A Unified Approach Steps for Deriving an Object-Oriented Design Implementing an OOP in C A Short Preview of Object-Oriented Programming Example Databases Big Oh Notation Exercises 18 2 Pointers, Structures, Classes, Functions, Overloaded Functions, and Overlodaded Operators in C-\ h C++ Pointers C++ Pointer Arithmetic and Operations Call-by-Reference Using Pointers as Function Arguments Pointers as Return Values of Functions Structures in C Denning a Structure Pointers to Structures Accessing Structures Initializing Structures Structure as a Function Argument and Return Value Pointer to a Structure as a Function Argument Arrays of Structures Unions C++ Class 32

3 2.4.1 Defining a Member Function of a Class Outside Its Scope Defining an Object of a Class Accessing a Member of a Class Friend of a Class and Inheritance Derived Class and Multiple Inheritance Nested Class Functions in C Special Functions: Constructors Special Functions: Destructors Polymorphism, Virtual Functions, and Inheritance Friend Functions and Inheritance Overloading and Polymorphism Overloaded Functions Overloaded Operators Dangling Pointers and Memory Leaks Dangling Pointers Memory Leaks OOP Application: Complex Numbers Exercises 50 Arrays and Strings Array Objects One-Dimensional Arrays Declaration of Arrays in C Storing and Retrieving an Element in an Array Initializing an Array One-Dimensional Array Address Translation Array as Function Arguments One-Dimensional Array Object OOP for One-Dimensional Array Two-Dimensional Arrays C++Declaration of Two-Dimensional Arrays Storing and Retrieving an Element in a Two-dimensional Array Initializing a Two-Dimensional Array Translating Address of Two-Dimensional Array Elements Two-Dimensional Arrays as Function Arguments Two-Dimensional Array Object OOP Two-Dimensional Array Strings Implementing Strings Using Arrays and Pointers Array of Array-Based Strings Array of Pointers to Strings 77

4 xv String Object and Its OOP Implementation OOP Application: An Object-Oriented Database Exercises 94 Recursion Concept of Recursion Divide-and-Conquer and Recursion Recursive and Nonrecursive Functions in C Recursion and Trace of C++ Stack OOP Application: The Towers of Hanoi OOP Application: Nonattacking iv-queens Key Points for Using Recursion Exercises 126 Lists List Objects Implementation Specific Linked List Classes Array-Based Linked Lists OOP for Array-Based Linked Lists with Implicit Links Adding an Element After a Given Element Deleting an Element from an Array List Pointer-Based Linked Lists Non-OOP Implementation of the Singly Linked List OOP Implementation of the Singly Linked List Building a Singly Linked List Inserting an Element in a Singly Linked List Deleting an Element in a Singly Linked List Methods of the Singly_Linked_List Class OOP Implementation of the Doubly Linked List Adding an Element in a Doubly Linked List Deleting an Element in a Doubly Linked List Methods of the Doubly_Linked_List Class Circular List Objects OOP Implementation of Singly Linked Circular Lists Methods of the Circ_Linked_List Class Doubly Linked Circular List and Its OOP Implementation Performance Analyses of List Operations OOP Application: Polynomial Objects in Single Variable Concept of a Polynomial in Single Variable Polynomial Objects Object-Oriented Design and Implementation for Polynomials OOP Application: Memory Management 193

5 xvi Contents The Free List Free List Management by Counted Pointers Free List Management by Garbage Collection Summary Exercises Stacks and Queues Stack Objects OOP Array Implementation of a Stack Object OOP Implementation of a Stack Using Linked Lists Performance Analyses of Stack Operations Double Stack Objects OOP Application: Reverse Polish Notation Using Stacks Postfix Evaluation Infix to RPN Translation Queue Objects Implementation Specific Queue Classes OOP Implementation of a Queue Using Array OOP Implementation of a Queue Using Linked List Circular Queue Objects OOP Implementation of a Circular Queue Using Array OOP Implementation of a Circular Queue Using a Linked List Performance Analyses of Queue Operations OOP Application: SCAN Disk Scheduling with Priority Queues Exercises Sorting and Searching Sorting Methods Insertion Sort for an Array List Insertion Sort for a Linked List Selection Sort Bubble Sort Quicksort Merge Sort Binary Tree Sort Heap Sort Straight Radix Sort Radix Exchange Sort Shell Sort Performance Analyses of Sorting Methods Searching Methods Linear Search of an Unsorted Array 358

6 xvii Linear Search of an Unsorted Linked List Linear Search of a Sorted Array Linear Search of a Sorted List Binary Search of a Sorted Array Interpolation Search of a Sorted Array Fibonacci Search of a Sorted Array Searching a Binary Search Tree Hash Strategy for Hash Search Method Performance Analyses of Searching Algorithms Exercises Trees and Tries Fundamental Definitions and Terminology M-ary Trees Traversing a Tree Traversals of Binary Trees Tree Objects OOP Implementation of Binary Trees OOP Implementation of a Binary Tree Using Arrays OOP Implementation of a Binary Tree Using Pointers Methods of the Binary_Tree Class General Trees Strategies for Representing General Trees General Tree: Binary Tree Implementation General Tree Traversal OOP Implementation of a General Tree Methods of the General-Tree Class Search Trees Data-Comparative Search Trees Versus Radix Search Trees Data-Comparative M-ary Search Trees Inserting a Node and Building a Binary Search Tree Deleting a Node from a BST OOP Implementation of a Binary Search Tree Using Pointers Methods of the Binary_Search_Tree Class BST and Quicksort Relationship Balance Characteristics of Comparative-Based Search Tree AVL Trees AVL Tree Objects OOP Implementation of an AVL Tree Using Pointers Insertion of a Node in an AVL Tree Inserting a New Node into an AVL Tree 464

7 ii Contents Inserting a Node and Building an AVL Tree Creating a Node for an AVL Tree Deleting a Node from an AVL Tree Regaining Balance with Rotation Techniques Radix Search Trees Discrete Versus Non-Discrete Keys Digital Search Trees OOP Implementation of a Binary Digital Search Tree Radix Search Tries OOP Implementation of an M-ary Radix Search Trie Balance Characteristics of Radix Search Trees Hybrid Radix Search Tries Radix Search Tries and Radix Exchange Sorting OOP Application: Word Dictionaries Using Tries Patricia Trees and Tries Comparative-Based B-Trees for External Searching and Sorting B-Tree Objects Inserting a Key and Building a B-Tree Deleting a Key from a B-Tree Performance Analysis of Tree Operations Exercises 518 Multidimensional Search Trees and Search Tries Extending the Single-Key Model Geometric Formulation of Associative Search Records as Points in Key-Space Geometric Objects in Euclidean Space Types of Associative Search Examples of Associative Search Approaches to Associative Search ADT Inverted List Multidimensional Comparative-Based Search Trees K-Tree Objects OOP Implementation of Quadtree K-Tree Balance and Node Deletion Kd-Tree Objects OOP Implementation of 3d-Tree Kd-Tree Balance and Node Deletion Multidimensional Radix Search Tries K-Trie Objects Kd-Trie Objects Implementation of K-Trie and Kd-Trie Compact Trie Representations Multidimensional Structures for External Search 565

8 xix 9.9 Summary: A Taxonomy of Trees and Tries Exercises Graphs and Digraphs Fundamental Definitions and Terminologies Graph Traversal Depth-First Traversal Breadth-First Traversals Graph Objects Implementations of a Graph Representing a Weighted Undirected or Directed Graph Using Adjacency Matrix OOP Implementation of a Graph Using Adjacency Matrix Methods of Weighted_DiGraph Class OOP Implementation of a Graph Using Linked Adjacency Lists Methods of the Wt_DiGraph Class Spanning Trees of a Graph Constructing a Spanning Tree Using Depth-First Traversals Constructing a Spanning Tree Using Breadth-First Traversals OOP Application: Determining the Shortest Path in a Weighted Digraph Using Dijkstra's Algorithm Exercises An Object-Oriented Database with B-Trees Specification of People Database System OOP Implementation of Simple People Database Using B-Trees Methods of the B_Tree Class Object-Oriented People Database Program Limitations of Implementation Exercises Applications in Image Processing, Computer Graphics, and Computer-Aided Design D Digital Image Compression with a Quadtrie Object Computer-Aided VLSI Design Verification with a 4D-Tree Object D Ray-Tracing Acceleration with an Octrie Object D Hidden Surface Removal with a BSP Tree Object Exercises 684

9 : xx Contents A C++ Fundamentals 687 A.I C++ Key Words 687 i A.2 C++ Special Characters 687! A.3 Allowed Overloaded Operators in C ' A.4 C++ Built-in Data Types 687 A.5 Statement Formats of Some C++ Keywords 688 A.6 A Sample C++ Program 689 A.7 C++ Preprocessor Directives 689 A.8 Creating Executables for C++ Programs 690 B Assorted Library Functions for Handling Strings 691 C Example Databases 693 C.I PEOPLE and GEOMETRY Databases 693 C.I.I PEOPLE_1D 693 C.I.2 PEOPLE.2D 696 C.1.3 PEOPLE.3D 697 C.1.4 GEOMETRY_2D 698 C.I.5 GEOMETRY_3D 699 References 701 Index 704