Beginning Data Structures and Algorithms in Java

Data structures provide a way of storing and organizing data so that it can be used efficiently. Beginning Data Structures in Java provides Java developers at any level a thorough overview of data structures, and equips them with the tools they need to apply their knowledge in the real world. The book starts with small initial problems that programmers, students or trainers usually face and gradually dives deeper for complex concepts. The solutions are paired with explanation and figures at every step. By the end of the book, readers will be well versed with the deep concepts of data structures and the different operations that can be applied to them The book provides solutions to: What are Linked Lists and the operations that can be performed with them What are Stacks, Queues, Circular Queues and Sparse Matrices How Binary Search trees are made and how can they be traversed recursively and non-recursively What are AVL trees and how are they balanced The concept of Threaded binary trees and searching, inserting and deleting nodes from threaded trees How Graphs are represented through Adjacency Linked List and Adjacency Matrices and how the Breadth first and Depth fist search techniques are implemented on Graphs Different sorting techniques including bubble sort, insertion sort, selection sort, quick sort, merge sort, radix sort, shell sort etc. Minimal spanning trees including Kruskal, Prim's algorithms Conversions between infix to postfix, infix to prefix, etc. The book will be of great use for any Java developer working on system programming.