Jump to ratings and reviews
Rate this book

Easy Learning Data Structures & Algorithms Java Practice: Graphically learn data structures and algorithms better than before

Rate this book
Data Structures and Algorithms Java Practice, 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. Linear Table Definition
2. Linear Table Append
3. Linear Table Delete
4. Linear Table Search
5. Bubble Sorting Algorithm
6. Select Sorting Algorithm
7. Insert Sorting Algorithm
8. Dichotomy Binary Search
9. Unidirectional Linked List
10. Doubly Linked List
11. One-way Circular LinkedList
12. Two-way Circular LinkedList
13. Queue
14. Stack
15. Recursive Algorithm
16. Two-way Merge Algorithm
17. Quick Sort Algorithm
18. Binary Search Tree
18.1 Construct a binary search tree
18.2 Binary search tree In-order traversal
18.3 Binary search tree Pre-order traversal
18.4 Binary search tree Post-order traversal
18.5 Binary search tree Maximum and minimum
18.6 Binary search tree Delete Node
19. Binary Heap Sorting
20. Hash Table
21. Graph
21.1 Undirected Graph and Depth-Frst Search
21.2 Undirected Graph and Breadth-First Search
21.3 Directed Graph and Depth-Frst Search
21.4 Directed Graph and Breadth-First Search
21.5 Directed Graph Topological Sorting

244 pages, Kindle Edition

Published May 2, 2019

17 people are currently reading
11 people want to read

About the author

Yang Hu

312 books1 follower

Ratings & Reviews

What do you think?
Rate this book

Friends & Following

Create a free account to discover what your friends think of this book!

Community Reviews

5 stars
3 (33%)
4 stars
4 (44%)
3 stars
0 (0%)
2 stars
1 (11%)
1 star
1 (11%)
Displaying 1 of 1 review
Profile Image for Srinivasan Nanduri.
479 reviews12 followers
May 11, 2021
Very basic and can be just an OK for beginners. Explanation through diagrams is a great attempt but some of the topics can well be simplified further. For example, we do not a doubly linked list for a Queue - easier done with Singly linked list etc. On the other hand, topics like heap sort although illustrative could not maintain the reach through explanation.
Displaying 1 of 1 review

Can't find what you're looking for?

Get help and learn more about the design.