DATA STRUCTURES WITH C SEYMOUR LIPSCHUTZ Implementation of algorithms and procedures using C Simplified presentation of Arrays, Recursion, Linked Lists, Queues, Trees, Graphs, Sorting & Searching Methods and Hashing Excellent pedagogy. Includes 255 Solved examples and problems 86 C Programs 160 Supplementary problems 100 Programming problems 135 Multiple-choice questionsData Structures With C Tata McGraw-Hill Adapted in India by arrangement with The McGraw-Hill Companies, Inc., New York, Sales Territories: India, Nepal, Bangladesh, Sri Lanka and Bhutan Copyright © 2011, by The McGraw-Hill Companies, Inc. All rights reserved. No part of this publication may be reproduced or distributed in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise or stored in a database or retrieval system without the prior written permission of The McGraw-Hill Companies, Inc. including, but not limited to, in any network or other electronic storage or transmission, or broadcast for distance learning, This edition can be exported from India only by the publishers, ‘Tata McGraw Hill Education Private Limited ISBN (13): 978-0-07-070198-4 ISBN (10): 0-07-070198.9 Vice President and Managing Director—McGraw-Hill Education, Asia Pacific Region: Ajay Shukla Head—Higher Education Publishing and Marketing: Vibha Mahajan Manager—Sponsoring (SEM & Tech. Ed.): Shalini Jha Asst Sponsoring Euitor: Surabhi Shukla Development Editor: Surbhi Swnan Executive—Editorial Services: Shin’ Mukherjee Jt Manager—Production: Anjali Racdan Dy Marketing Manager—SEM & Tech Ed: Biju Ganesan General Manager—Production: Rajender P Ghansela Asst General Manager—Production: BL Dogra Information contained in this work has been obtained by Tata McGraw-Hill, from sources believed to be reliable. However, neither Tata McGraw-Hill nor its authors guarantee the accuracy or completeness of any information published herein, and neither Tata McGraw-Hill nor its authors shall be responsible for any errors, omissions, or damages arising ‘out of use of this information, This work is published with the understanding that Tata McGraw-Hill and its authors are supplying information but are not attempting to render engineering or other professional services. If such services are required, the assistance of an appropriate professional should be sought. ‘Typeset at Bukprint India, B-180A, Guru Nanak Pura, Laxmi Nagar, Delhi 110 092, and printed at Lalit Offset Printer, 219, FLE., Patpar Ganj, Industrial Area, Delhi 110 092 Cover: SDR Printers RQXLCRBZDLLBCContents A Word to the Readers of the Special Indian Edition Preface 1 INTRODUCTION AND OVERVIEW W=L20 Be LL Introduction 1.2 1.2. Basic Terminology: Elementary Data 13 Data Structures 13 1.4 Data Structure Operations 1.9 LS Abstract Data Types (ADT) 1.10 1.6 Algorithms: Complexity, Time-Space Tradeoff 1.12 ‘Saled Problems 114 Multiple Choice Questions 1.20 ; Answers 10 Multiple Choice Questions 1.20 ‘2_PRELIMINARIES 00 287 2 > ‘ 1‘ is 2.3. Algorithmic Notations 2.6 24 Control Structures 2.9 2.5 Complexity of Algorithms 2.15 2.6 Other Asymptotic Notations for Complexity of Algorithms @, 0, 02.19 2.7 Subalgorithms 2.20 2.8 Variables, Data Types 2.22 Solved Problems 2.25 Supplementary Problems 2.35 Pro ing Problems 2.36 Multiple Choice Questions 2.37 Answers to Multiple Choice Questions 2.37 4_STRING PROCESSING 0 3.1 Introduction _3./ ‘3.2. Basic Terminology _3./ ‘3.3. Storing Strings 3.2 3.4 Character Data Type 3.6 ‘3.8 Pattern Matching Algorithms 3.20 ‘Solved Problems 3.28 Copyrighted materialSupptementary Problems 3.39 Programming Problems 3.40 Muttiple Choice Questions 3.41 Answers to Multiple Choice Questions 3.42 4. ARRAYS, RECORDS AND POINTERS 4.1 Introduction 4.1 4.2 Linear Arrays 4.2 4.3 Arrays as ADT_4.4 4.4 Representation of Linear Arrays in Memory 4.6 4.3 Traversing Linear Arrays 4.8 4.6 Inserting and Deleting 410 4.7 Sorting; Bubble Son. 4.15 4.8 Searching; Linear Search 4.19 4.9 Binary Search 4.22 4.10 Multidimensional Arrays 4.27 4.11 Representation of Polynomials Using Arrays 4.36 4.12 Pointers; Pointer Arrays 4.40 4.13 Dynamic Memory Management 4.47 4.14 Records; Record Structures 4.49 4.15, Representation of Records in Memory; Parallel Arrays 452 4.16 Matrices 4.54 4.17 Sparse Matrices 4.60 Solved Problems 4.65 Supplementary Problems 4.80 Progranming Problems 4381 Multiple Choice Questions 4.85 Answers to Multiple Choice Questions 4.85 S_LINKED LISTS 5.3 Representation of Linked Lists in Memory 5.4 5.4 Traversing a Linked List_5.8 5.5 Searching a Linked List 5.12 5.6 Memory Allocation; Garbage Collection 5.17, 7 re = ‘5.0 Header Linked Lists $38 5.10 Circularly Linked Lists 5.47 5.11 Two-way Lists (of Doubly Linked Lists) 5.52 5.12 us Problem and its Solution 5.63 5.13 Buddy Systems 5.65 Solved Problems 5.67 Supplementary Problems 5.76 Programming Problems 5.80 4.1 - 4.85 Copyrighted materialMultiple Choice Questions 5.82 Answers to Multiple Choice Questions 5.83 6. STACKS, QUEUES, RECURSION 6.1 Introduction 6.1 62 Stacks 6.2 6.3 Array Representation of Stacks 6.4 64 Linked Representation of Stacks 6.8 &3 Suck ADT 6 6.6 Arithmetic Expressions; Polish Notation 6.15 6.7 Application of Stacks 6.25 68 Recursion 6.33 6.9 Towers of Hanoi_6.39 6.10 Implementation of Recursive Procedures by Stacks 6.44 6.11 Queues 6.50 6.12 Linked Representation of Queues 6.57 6.13 Queue as ADT 6.64 6.14 Circular Queues 6.67 6.15 Deques 6.78 6.16 Priority Queues 6.79 6.17 Applications of Queues 6.92 Solved Problems 6.101 Supplementary Problems 6.119 Programming Problems 6.123 Multiple Choice Questions 6.124 Answers to Multiple Choice Questions 6.125 1._TREES LL Antroduction 2. 7.2 Binary Trees 7.1 7.3 Representing Binary Trees in Memory 7.5 7.4 Traversing Binary Trees 7.9 7.5 Traversal Algorithms Using Stacks 7.12 7.6 Header Nodes: Threads 7.23 7.7. Threaded Binary Trees _7. 78 Binary Search Trees 7.28 7.9 Searching and Inserting in Binary Search Trees _7.29 7.10 Deleting in a Binary Search Tree 7.38 7.11 Balanced Binary Trees 7.49 7.12 AVL Search TREes 7.50 113 Inssttion in an AVL Search Tree 7.51 7.14 Deletion in an AVL Search Tree 7.57 7.15_m-way Search Trees 7.61 7.16 Searching, Insertion and Deletion in an m-way Search Tree__7.63 717 B-Trees 7.66 7.18 Searching, Insertion and Deletion in a B-tree 7.67x Contents 7.19 B+-Trees 7.73 7.20 Red-Black Trees 7.78 7.21 Heap; Heapsort 7.90 7.22 Path Lengths; Huffman’s Algorithm 7.103 7.23 General Trees 7 109 7.24 Applications of Trees 7.112 Solved Problems 7.114 Supplementary Problems 7.132 Programming Problems 7.139 Multiple Choice Questions 7.142 8. GRAPHS AND THEIR APPLICATIONS 81-877 8.1 Introduction 81 8.2. Graph Theory Terminology _8./ Sequential Representation of Graphs: 4 8.4 Warshall's Algorithm; Shortest Paths 8.9 8.5 Linked Representation of a Graph 8.17 8.6 Operations on Graphs 8.20 8&7 Traversing a Graph 837 8.8 Posets; Topological Sorting 8.40 89 Spanning Trees 8.47 Solved Problems 8.59 Supplementary Problems 8.71 Programming Problems _ 8.74 9. SORTING AND SEARCHING 9.1 9.56 9.1 Introduction 9 1 9.2 Sorting 9.1 9.3 Insertion Sort 2.6 9.4 Selection Sort 9.40 9.5 Merging 9.14 9.6 Merge-Sort 9.19 97 Shell Sor 9.3, 9.9 Searching and Data Modification 9.38 9.10 Hashing 9.47 Solved Problems 9,53 Programming Problems 9.55 Multiple Choice Questions 9.55 Answers to Multiple Choice Questions 9.56 index LL=k2A Word to the Readers of the Special Indian Edition Data Structures is a subject of primary importance to the discipline of Computer Science and Engineering. Itis a logical and mathematical model of storing and organizing data in a particular way in a computer, required for designing and implementing efficient algorithms and program development. Different kinds of data structures like arrays, linked lists, stacks, queues, etc., are suited to different kinds of applications. Some specific data structures are essential ingredients of many efficient algorithms, and make possible the management of huge amounts of data, such as large databases and Internet indexing services. For example, B-trees are particularly well-suited for implementation of databases, while compiler implementations usually use hash tables to look up identifiers. Nowadays, various programming languages like C, C+ and Java are used to implement the concepts of Data Structures, of which C remains the language of choice for programmers across the world. This book provides the implementation of algorithms and pseudocodes using C in every chapter, thereby. making it easier for the readers to comprehend the theory, Multiple-Choice Questions included in the text are aimed to help students practice the learnt concepts. Thus, we hope that this book will be an excellent self-teach and test-preparation material for beginners. Salient Features * Demonstrates the implementation of algorithms and procedures related to data-structure concepts using the C programming language * Offers simplified presentation for important topics—Arrays, Recursion, Linked Lists, Queues, Trees, Graphs, Sorting and Searching Methods, Hashing = ADT representation of Arrays, Strings, Linked Lists, Stacks and Queues * Provide apt discussions on notations of Algorithm complexity, Representation of polynomials using arrays, and linked lists, Dynamic memory management, Josephus problem, Linked list and queue operations, Application of stacks, queues and trees, Spanning trees, AVL-trees, m-way trees, B-trees, B+-trees, Red-black trees, Sorting algorithm, Hash table + Excellent pedagogical features: 180 Solved Examples «86 C Programs * 175 Solved Problems ‘+ 160 Supplementary Problems (unsolved) 100 Programming Problems 135 Multiple-Choice Questions