Table Of ContentD S S
ata tructure implifieD
Implementation Using C++
D S S
ata tructure implifieD
Implementation Using C++
Jitendra Singh
α
Alpha Science International Ltd.
Oxford, U.K.
Data Structure Simplified
Implementation Using C++
368 pages
Jitendra Singh
Department of Computer Science
PGDAV College
University of Delhi
Copyright © 2018
ALPHA SCIENCE INTERNATIONAL LTD.
7200 The Quorum, Oxford Business Park North
Garsington Road, Oxford OX4 2JZ, U.K.
www.alphasci.com
ISBN 978-1-78332-370-8
Printed from the camera-ready copy provided by the Author.
All rights reserved. No part of this publication may be reproduced, stored in a retrieval system,
or transmitted in any form or by any means, electronic, mechanical, photocopying, recording
or otherwise, without prior written permission of the publisher.
Limits of Liability and Disclaimer of warranty
Author and the publisher have put their best to ensure that the programs, functions, description should be without error. However,
publisher and the author do not make any warranty of any kind, expressed or implied with regard to these programs, function or
other documentation used in the book. Authors and publisher shall not be liable for any kind of damage, incident, or performance
issues that take place due to implementation of these programs.
Dedicated to
my beloved sister Anita, my respected
father Sh. Jabar Singh Yadav
&
my mother Smt. R.B. Yadav
Preface
This book has been written to develop the necessary skill needed to understand the data structure concept
and programming. Important topics of data structure are extensively covered. We have started our book
from Abstract data type and algorithm. In abstract data type, we have discussed about the significance of
Abstract data type in data structure. The second focus of this chapter is to highlight the significance of
algorithm in designing and solving the computer problems. We believe that understanding of this topic
before the implementation of other topics will enable the readers in effective reading as well as writing
of code. Mere writing the algorithm is not enough, instead writing an efficient algorithm is the need of
an hour. This can be accomplished with the help of an efficient and effective algorithm writing and same
has been highlighted in the remaining chapters.
Arrays and pointers are one of the most important topics in data structure. Familiarization with
these topics at early stage of learning will facilitates readers in comprehensive learning of complex code
that is written using pointers and array. This chapter covers the usage of array and pointers. To ensure
that the students have grasped the concept completely, enough exercises along with their answers have
been included within the chapter as well as at the end of the chapter. Strong understanding of arrays and
pointers will be extremely helpful in understanding the advance topics, including the link list, stack, trees
among others.
In areas where access of one item after another is needed, link list is most appropriate for such type
of requirements. Usage of link list allows the linear traversal. In link list, user can traverse with the help
of next pointer that is stored in each node of a link list. Various aspects of link list including insertion of
the node at any position and deletion of any node is discussed in detail. Majority of the topics related to
the link list are extensively covered. This topic is discussed before the stack to highlight the concept of
dynamic memory allocation and organizing the element in a dynamic data structure. This will also assist
readers in the creation of dynamic stack that is widely used in subsequent chapters of the book.
The next two chapters are related to the arrangement and accessing of the item. We have started it
from the data structure that is opened from one end. This data structure is termed as stack. The second data
structure is also related to the arrangement of item(s). However, it is equipped with two ends and knows
as queue. One end is utilized for insertion whereas the other one is utilized for the removal of items. We
will be widely utilizing this data structure in the other chapters of this book wherever we need to store
the element and access them in the order of insertion.
Linear data structure is followed by non-linear data structure and started with definition of trees and
the need of the tree. Heading further, we have discussed the special case of a tree known as binary search
tree (BST). Major concepts pertaining to BST including insertion of a node, traversal in a BST, deletion
of the node have been extensively covered. In addition, we have also covered the programming of tree in
detail. All the programs written in this chapter and the subsequent chapters are adequately tested (Turboc
compiler) before including them in this text book.
Further extending the topic of tree, we have considered the advance tree in which the major limitations
viii Preface
of BST have been discussed. To overcome the limitation of BST, other advance tree has been discussed.
Consequently, threaded tree and AVL tree are discussed in detail. BST, AVL tree, threaded tree etc. are
of order 2, as a result, attaching more than two nodes is not possible. To accommodate more than two
nodes multiway tree have been discussed. Range of topics pertaining to multiway, including B+ tree, B*
trees have been described in detail.
Text book on data structure would not be complete without discussing the core concept of string and
sorting. In order to abreast the readers with string and sorting, these topics are widely described in the
chapter on sorting and strings. Readers can get equipped themselves with various sorting and searching
techniques applied for the manipulation of string.
Eventually, we have discussed the graphs that are needed in the wide variety of applications, for
instance, during routing in a network. The key focus of this chapter is to cover the basics of graphs,
representations techniques of graphs, and various methods that are applied for the traversal in a graph
etc. Finally, shortest path is determined from the source to the destination by applying the prominent
techniques existing.
Acknowledgement
It was indeed motivation and encouragement from many of my students who have consistently inspired
me for writing this book. Infact, students were aiming for the text book that should enrich them both
theoretically as well as practically. At the same time, the book should be simple to read. Over and above,
it should enable them to learn the domain where the data structures can be applied.
This journey would have not been completed without the support of many of my colleagues. It will
not be possible to name all of them, indeed, it is worth naming few of them. First and foremost, I am
extremely thankful to Dr. Vikas Kumar, who has taught me the art of presenting the text. He has also
encouraged me to write few books after submission of my thesis. I am also grateful to my colleagues
in PGDAV College (University of Delhi, India), Stratford University, USA (India Campus), who have
always discussed me about data structure and the need of a book that should have wide coverage on the
case study aspect of data structure.
I am extremely thankful to my wife Ms. Nitu and son Varunjit Singh for extending their cooperation
and sparing me for long hours that were needed for writing this book. Finally, I devote this book to my
parents who are the constant source of my motivation and inspiration. They have indeed encouraged me
to contribute in computer domain in order to benefit the entire computer fraternity, and people below the
bottom line in particular.
Jitendra Singh
