Easy Learning Data Structures & Algorithms C++: Graphic Data Structures & Algorithms (C++ Foundation Design Patterns & Data Structures & Algorithms)

This book Made Easy to learn Data Structures and Algorithms. There are multiple solutions for each problem and the book is coded in C++, it comes handy as an interview and exam guide for computer scientists.All data structures are illustrated with simple examples and diagrams. Every important feature of the language is illustrated in depth by a complete programming example. Wherever necessary, picture descriptions of concepts are included to facilitate better understanding.1. Linear Table Definition2. Linear Table Append3. Linear Table Insert4. Linear Table Delete5. Linear Table Search6. Bubble Sorting Algorithm7. Select Sorting Algorithm8. Insert Sorting Algorithm9. Dichotomy Binary Search10. Unidirectional Linked List10.1 Create and Initialization10.2 Add Node10.3 Insert Node10.4 Delete Node11. Doubly Linked List11.1 Create and Initialization11.2 Add Node11.3 Insert Node11.4 Delete Node12. One-way Circular LinkedList12.1 Initialization and Traversal12.2 Insert Node12.3 Delete Node13. Two-way Circular LinkedList13.1 Initialization and Traversal13.2 Insert Node13.3 Delete Node14. Queue15. Stack16. Recursive Algorithm17. Two-way Merge Algorithm18. Quick Sort Algorithm19. Binary Search Tree 19.1 Construct a binary search tree 19.2 Binary search tree In-order traversal 19.3 Binary search tree Pre-order traversal 19.4 Binary search tree Post-order traversal 19.5 Binary search tree Maximum and minimum 19.6 Binary search tree Delete Node20. Binary Heap Sorting21. Hash Table22. Graph 22.1 Undirected Graph and Depth-Frst Search 22.2 Undirected Graph and Breadth-First Search 22.3 Directed Graph and Depth-Frst Search 22.4 Directed Graph and Breadth-First Search22.5 Directed Graph Topological Sorting

• | Author: Yang Hu
• | Publisher: Independently published
• | Publication Date: Sep 28, 2019
• | Number of Pages: 216 pages
• | Language: English
• | Binding: Paperback
• | ISBN-10: 1696139910
• | ISBN-13: 9781696139915