We have referred to several data structures, such as lists, queues, binary trees, and so on. There is a very interesting theoretical basis behind these data structures. In this appendix, we shall study some of the most common data structures with several examples in the C programming language. Those not familiar with C can skip the programming examples, but are recommended to study the discussions of the various data structures.
A.1 LINKED LISTS
A linked list consists of data items that are arranged in a sequential order in such a manner that every data item contains the address of the next item in the list. In other words a data item points to the next item in the list. Therefore, an item contains data as well as ...