3 Review(s)

This book is meant primarily for polytechnic level colleges. In sync with demands of this market, the author follows a mantra of offering maximum stress on programs, and minimum stress on theoretical rigor. Kanetkar will be the only competition for this title and the idea is to snatch the polytechnic market share from this title. Key Features C Language used to implement Data Structures Trees explained in two chapters, detailing out concepts on Binary Search Trees and AVL Trees Online Learning Center, in the face of none provided by major competing titles Pedagogy Review Yourself: 138 MCQs: 127 Programming Exercises: 115 Solved Examples: 104 Illustrations: 247