DATA STRUCTURES AND ALGORITHMS : CONCEPTS, TECHNIQUES AND APPLICATIONS [electronic resource] /

Intended for a course on Data Structures at the UG level, this title details concepts, techniques, and applications pertaining to the subject in a lucid style. Independent of any programming language, the text discusses several illustrative problems to reinforce the understanding of the theory. It offers a plethora of programming assignments and problems to aid implementation of Data Structures. Features Lucid Language: Language used is easy to comprehend and the text steers clear of complicated formalisms, case in point being the coverage of Trees. Exhaustive coverage: Separate chapters for Binary Search Trees and AVL Trees, B-Trees and Tries, and Red Black Trees and Splay Trees. Example driven approach: After a brief introduction to the topic, the text applies these concepts using solved examples and algorithms. Eg. Infix, Prefix, and PostFix Expressions. Use of Pseudocodes: Will provide students with flexibility in terms of language of implementation. Unique Feature: ADT for each Data Structure has been discussed in a separate section at the end of every chapter. Breakup of Examples and Problems Solved Examples: 124 Review Questions: 215 Illustrative Problems: 133 Programming Assignments: 74 Illustrations: 369