preface to the second edition --new programs on parenthesis checking and evaluation of prefix expressions have been added recursionwhich is one of the most common applications of stackshas been moved to this --new programs on priority queues and multiple queues have been included --this now includes sections on general treesforestsconversion of general trees into binary treesand constructing binary tree from traversal results --an algorithm for in-order traversal of threaded binary tree has been added -- table summarizing the differences between and btrees and section on - trees have been included -- brief section on how binary heaps can be used to implement priority queues has been added --this now includes section which shows the adjacency multi-list representation of graphs --as result of organizationthe sections on linear and binary search have been moved from to this new search techniques such as interpolation searchjump searchand fibonacci search have also been included the also extends the concept of sorting by including sections on practical considerations for internal sortingsorting on multiple keysand tree sort --new sections on bucket hashing and rehashing have been included --this now includes section on cylinder surface indexing which is one of the widely used indexing structures for files stored in hard disks content and coverage this book is organized into introduction to provides review of basic constructs which helps readers to familiarize themselves with basic syntax and concepts that will be used to write programs in this book introduction to data strctures and algorithms introduces data structures and algorithms which serve as building blocks for creating efficient programs the explains how to calculate the time complexity which is key concept for evaluating the performance of algorithms from onwardsevery discusses individual data structures in detail arrays provides detailed explanation of arrays that includes one-dimensionaltwodimensionaland multi-dimensional arrays the operations that can be performed on such arrays are also explained strings discusses the concept of strings which are also known as character arrays the not only focuses on reading and writing strings but also explains various operations that can be used to manipulate the character arrays structures and unions deals with structures and unions structure is collection of related data items of different types which is used for implementing other data structures such as linked liststreesgraphsetc we will also read about unions which is also collection of variables of different data typesexcept that in case of unionswe can only store information in one field at any one time linked lists discusses different types of linked lists such as singly linked listsdoubly linked listscircular linked listsdoubly circular linked listsheader linked listsand multi-linked lists linked list is preferred data structure when it is required to allocate memory dynamically www allitebooks com