Data Structures using C

This book provides a quick study of data structures. The conventions of 'C' language is used to describe the used algorithms and Data Structures primarily, because of their value. The book provides a comprehensive and technically rigorous introduction to data structures such as arrays, stacks, queues, linked lists, trees and graphs and techniques such as sorting hashing that form the basis of all software. In addition, this text presents advanced or specialized data structures such as priority queues, efficient binary search trees, and multiway search trees. The book now discusses topics such as heaps, min-max heaps, Splay trees, B+ trees and suffix trees. Red-black trees have been made more accessible.This book will be an excellent self-teach and test preparation material for beginners.

Autorentext
C, KavithaC. Kavitha received her BE degree from Agni College of Technology, Chennai and her ME degree from Saveetha Engineering College, Chennai. She is pursuing her PhD in information and communication engineering at Anna University, Chennai. She has a teaching experience of 4.4 years and currently working with Sathyabama Institute of Science & Technology.

Klappentext

This book provides a quick study of data structures. The conventions of 'C' language is used to describe the used algorithms and Data Structures primarily, because of their value. The book provides a comprehensive and technically rigorous introduction to data structures such as arrays, stacks, queues, linked lists, trees and graphs and techniques such as sorting hashing that form the basis of all software. In addition, this text presents advanced or specialized data structures such as priority queues, efficient binary search trees, and multiway search trees. The book now discusses topics such as heaps, min-max heaps, Splay trees, B+ trees and suffix trees. Red-black trees have been made more accessible.This book will be an excellent self-teach and test preparation material for beginners.