Python Data Structures and Algorithms.
Chapter 2: Python Data Types and Structures; Operations and expressions; Boolean operations; Comparison and Arithmetic operators; Membership, identity, and logical operations; Built-in data types; None type; Numeric Types; Representation error; Sequences; Tuples; Dictionaries; Sorting dictionaries;...
Saved in:
| Online Access: |
Full text (MCPHS users only) |
|---|---|
| Main Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Birmingham, UNKNOWN :
Packt Publishing,
2017
|
| Subjects: | |
| Local Note: | ProQuest Ebook Central |
Table of Contents:
- Cover; Copyright; Credits; About the Author; About the Reviewer; www.PacktPub.com; Customer Feedback; Table of Contents; Preface; Chapter 1: Python Objects, Types, and Expressions; Understanding data structures and algorithms; Python for data; The Python environment; Variables and expressions; Variable scope; Flow control and iteration; Overview of data types and objects; Strings; Lists; Functions as first class objects; Higher order functions; Recursive functions; Generators and co-routines; Classes and object programming; Special methods; Inheritance; Data encapsulation and properties.
- Doubly linked listsA doubly linked list node; Doubly linked list; Append operation; Delete operation; List search; Circular lists; Appending elements; Deleting an element; Iterating through a circular list; Summary; Chapter 5: Stacks and Queues; Stacks; Stack implementation; Push operation; Pop operation; Peek; Bracket-matching application; Queues; List-based queue; Enqueue operation; Dequeue operation; Stack-based queue; Enqueue operation; Dequeue operation; Node-based queue; Queue class; Enqueue operation; Dequeue operation; Application of queues; Media player queue; Summary.
- Chapter 6: TreesTerminology; Tree nodes; Binary trees; Binary search trees; Binary search tree implementation; Binary search tree operations; Finding the minimum and maximum nodes; Inserting nodes; Deleting nodes; Searching the tree; Tree traversal; Depth-first traversal; In-order traversal and infix notation; Pre-order traversal and prefix notation; Post-order traversal and postfix notation.; Breadth-first traversal; Benefits of a binary search tree; Expression trees; Parsing a reverse Polish expression; Balancing trees; Heaps; Summary; Chapter 7: Hashing and Symbol Tables; Hashing.
