English | 2019 | ISBN: 978-1098735487 | 208 Pages | EPUB, AZW3 | 18 MB
Data Structures and Algorithms Python 3, It is designed to be easy to read and understand although the topic itself is complicated. Algorithms are the procedures that software programs use to manipulate data structures. Besides clear and simple example programs,The programs demonstrate in graphical form what data structures look like and how they operate.
1. Bubble Sorting Algorithm
2. Select Sorting Algorithm
3. Insert Sorting Algorithm
4. Dichotomy Binary Search
5. Unidirectional Linked List
5.1 Create and Traversal
5.2 Add Node
5.3 Insert Node
5.4 Delete Node
6. Doubly Linked List
6.1 Create and Traversal
6.2 Add Node
6.3 Insert Node
6.4 Delete Node
7. One-way Circular LinkedList
7.1 Initialization and Traversal
7.2 Insert Node
7.3 Delete Node
8. Two-way Circular LinkedList
8.1 Initialization and Traversal
8.2 Insert Node
8.3 Delete Node
9. Queue
10. Stack
11. Recursive Algorithm
12. Two-way Merge Algorithm
13. Quick Sort Algorithm
14. Binary Search Tree
14.1 Construct a binary search tree
14.2 Binary search tree In-order traversal
14.3 Binary search tree Pre-order traversal
14.4 Binary search tree Post-order traversal
14.5 Binary search tree Maximum and minimum
14.6 Binary search tree Delete Node
15. Binary Heap Sorting
16. Hash Table
17. Graph
17.1 Undirected Graph and Depth-Frst Search
17.2 Undirected Graph and Breadth-First Search
17.3 Directed Graph and Depth-Frst Search
17.4 Directed Graph and Breadth-First Search
17.5 Directed Graph Topological Sorting
Resolve the captcha to access the links!