This book treats the Data Structure algorithms in a form that is machine and language independent. It adopts an elementary approach to the subject matter with many examples & diagrams and is suited to be of great assistance as a textbook or supplement for effective self-study.
Features:
Algorithms are presented in pseudocode. Highly illustrative with over 300 figures and 375 exercises. Discussion of Linked representation of Stacks and Queues. Detailed inclusion of new topics within Trees : AVL Search Trees, m-way Search Trees and B Trees.