80%(10)80% found this document useful (10 votes) 43K views289 pagesData Structures With C - by Schaum Lipschutz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here.
Available Formats
Download as PDF or read online on Scribd
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 questionsData Structures With C
Tata McGraw-Hill
Adapted in India by arrangement with The McGraw-Hill Companies, Inc..
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
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
imited to, in any network of 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 Editor: Surabhi Shukla
Development Editor: Surbhi Suman
Executive—Editorial Services: Sohini Mukherjee
Je Manager—Production: Anjali Razdan
Dy Marketing Manager—SE!
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, ELE., Patpar Ganj. Industrial Area, Delhi 110 092
Cover: SDR Printers
RQXLCRBZDLLBCContents
A Word to the Readers of the Special Indian Edition ai
Preface av
2.5 Complexity of Algorithms 2.15
2.6 Other Asymptotic Notations for Cor
(2.7 Subalgorithms 2.20 -
(2.8 Variubles, Data Types 2.22
2 "Eat
y of Algorithms 2, @, 02.19
Supplementary Problems 2.35
‘Programming Problems 2.36,
Mul ce Questions 2.37
Answers io Muliple Choice Questions 2.37
Copyrighted material