Hands -on Data Structures and Algorithms with Python Hands -on Data Structures and Algorithms with Python
By Basant Agarwal and Benjamin Baka
Book Review Prof Dipali Mahajan,Pratibha Collge of Commerce and Computer Studies,Chinchwad, Pune.
About Book Content:
- Author: Basant Agarwal and Benjamin Baka
- Publication: SPD Shroff Publishers & Distributors PVT. LTD
- Name of the Book Reviewer: Mahajan, Dipali
This book is very helpful for anyone who wants to clearly understand data structures and algorithms using Python. It starts with the basics, such as linked lists, doubly linked lists, and circular linked lists, and explains them in an easy and understandable way. The concepts are explained step by step, which makes learning comfortable even for beginners.
As you progress through the chapters, the book introduces more advanced data structures like stacks, queues, graphs, and trees. Topics such as binary search and binary search trees are explained using simple examples and diagrams, which makes complex ideas easier to grasp. The explanations focus not only on theory but also on how and where these algorithms are used in real programming tasks.
The book also covers important sorting algorithms like bubble sort, selection sort, insertion sort, and merge sort in detail. Each algorithm is explained clearly with
Book Review Prof Dipali Mahajan,Pratibha Collge of Commerce and Computer Studies,Chinchwad, Pune.
About Book Content:
- Author: Basant Agarwal and Benjamin Baka
- Publication: SPD Shroff Publishers & Distributors PVT. LTD
- Name of the Book Reviewer: Mahajan, Dipali
This book is very helpful for anyone who wants to clearly understand data structures and algorithms using Python. It starts with the basics, such as linked lists, doubly linked lists, and circular linked lists, and explains them in an easy and understandable way. The concepts are explained step by step, which makes learning comfortable even for beginners.
As you progress through the chapters, the book introduces more advanced data structures like stacks, queues, graphs, and trees. Topics such as binary search and binary search trees are explained using simple examples and diagrams, which makes complex ideas easier to grasp. The explanations focus not only on theory but also on how and where these algorithms are used in real programming tasks.
The book also covers important sorting algorithms like bubble sort, selection sort, insertion sort, and merge sort in detail. Each algorithm is explained clearly with