Skip to product information
1 of 1

The book has been an effort to explain the concepts of Data Structures in very simplified manner. The concepts has been discussed through algorithms written in pseudo code and then each step of the algorithm is explained in simple English sentences. Most difficult concepts thought by students has been explained with examples and in a simplified way. Concepts like Heap Trees, AVL trees, Red and Black Tress, Calculating the complexity of algorithms has been explained in easy language.

This book also covers the advanced topics in Data Structures. It is very beneficial for Ph.D.,M.Phil.,M.Tech.,M.C.A.,M.Sc.,B.Tech., B.C.A., P.G.D.C.A. etc courses.

This book can be used even for the preparation of competitive exams like GRE, GATE, UGC-NET, State Level Lecturership Eligibility tests etc.


 

View full details