Data Structures using C

Kavitha C

ISBN 10: 6203303801 / ISBN 13: 9786203303803

Published by LAP LAMBERT Academic Publishing Aug 2021, 2021

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 200 pp. Englisch.

Seller Inventory # 9786203303803

Bibliographic Details

• Title: Data Structures using C
• Publisher: LAP LAMBERT Academic Publishing Aug 2021
• Publication Date: 2021
• Language: English
• ISBN 10: 6203303801
• ISBN 13: 9786203303803
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 12D millimeters 220 millimeters width by 150 millimeters height by 12 millimeters depth
• Weight: 316 grams

About this title

Synopsis

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.