what this book covers python objectstypesand expressionsintroduces you to the basic types and objects of python we will give an overview of the language featuresexecution environmentand programming styles we will also review the common programming techniques and language functionality python data types and structuresexplains each of the five numeric and five sequence data typesas well as one mapping and two set data typesand examine the operations and expressions applicable to each type we will also give examples of typical use cases principles of algorithm designcovers how we can build additional structures with specific capabilities using the existing python data structures in generalthe data structures we create need to conform to number of principles these principles include robustnessadaptabilityreusabilityand separating the structure from function we look at the role iteration plays and introduce recursive data structures lists and pointer structurescovers linked listswhich are one of the most common data structures and are often used to implement other structuressuch as stacks and queues in this we describe their operation and implementation we compare their behavior to arrays and discuss the relative advantages and disadvantages of each stacks and queuesdiscusses the behavior and demonstrates some implementations of these linear data structures we give examples of typical applications treeswill look at how to implement binary tree trees form the basis of many of the most important advanced data structures we will examine how to traverse trees and retrieve and insert values we will also look at how to create structures such as heaps hashing and symbol tablesdescribes symbol tablesgives some typical implementationsand discusses various applications we will look at the process of hashinggive an implementation of hash tableand discuss the various design considerations graphs and other algorithmslooks at some of the more specialized structuresincluding graphs and spatial structures representing data as set of nodes and vertices is convenient in number of applicationsand from thiswe can create structures such as directed and undirected graphs we will also introduce some other structures and concepts such as priority queuesheapsand selection algorithms [