Название: Data Structures using C: A Practical Approach for Beginners
Автор: Amol M Jagtap, Ajit S Mali
Издательство: CRC Press
Год: 2022
Страниц: 363
Язык: английский
Формат: pdf (true)
Размер: 10.1 MB

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.

An algorithm is a step-by-step procedure for solving a problem. A sequential solution to any program that is scripted in any natural language is called as an algorithm. The algorithm is the frst step of the solving process. After the problem analysis, the developer writes the algorithm for this problem. It is largely used for data processing, computing and other related computer and mathematical operations.

The integer-type pointer points to value type integer variables, the foat type pointer points to foat value type variables and so on. In C, there is a general-purpose pointer that can point to any data type and is known as a void pointer. The void pointer is also called as generic pointer. A void pointer is one that does not have an associated data type. A void pointer can hold the address of any data type and can be typecast into any other data type.

Sometimes, we know we want a pointer, but we don’t necessarily know what kind of data it points to. The C/C++ language allows a peculiar pointer called as void pointer that allows us to produce a pointer that is not type specifc, meaning that it can be constrained to point to anything.