Data Structure Tutorial

Introduction to Data structures Software engineering is the study of ways in which to create large and complex computer applications and that generally involve many programmers and designers. At the heart of software engineering is …

Introduction to Pointer To understand pointers, you need a basic knowledge of how your computer stores infor-mation in memory. The following is a somewhat simplified account of PC memory storage. Pointers are so commonly used …

Pointers are declared by using the * in front of the variable identifier. For example: int *ip; float *fp = NULL; This declares a pointer, ip, to an integer. Let’s say we want ip to …

Imagine that we have an int called i. Its address could be represented by the symbol &i. If the pointer is to be stored as a variable, it should be stored like this. int *pi …

Introduction to Arrays An array is a data structure used to process multiple elements with the same data type when a number of such elements are known. You would use an array when, for example, you …

Application of Arrays Whenever we require a collection of data objects of the same type and want to process them as a single unit, an array can be used, provided the number of data items …

Array Manipulation Shown next are C programs for carrying out manipulations such as finding the sum of elements of an array, adding two arrays, and reversing an array. Program ADDITION OF THE ELEMENTS OF THE …

Merging Array Assume that two lists to be merged are sorted in descending order. Compare the first element of the first list with the first element of the second list. If the element of the …

Sorting Arrays We encounter several applications that require an ordered list. So it is required to order the elements of a given list either in ascending/increasing order or descending/decreasing order, as per the requirement. This process is called sorting. …

There are many applications requiring the use of the data structures stacks and queues. The most striking use of a data structure stack is the runtime stack that a programming language uses to implement a …

Working with Stacks A stack is simply a list of elements with insertions and deletions permitted at one end—called the stack top. That means that it is possible to remove elements from a stack in reverse order from the insertion of …

Working with Queues One of the applications of the stack is in expression evaluation. A complex assignment statement such as a = b + c*d/e–f may be interpreted in many different ways. Therefore, to give a unique …

A linked list is one of the fundamental data structures, and can be used to implement other data structures. It consists of a sequence of nodes, each containing arbitrary data fields and one or two …

Inserting a Node A linked list is a recursive data structure. A recursive data structure is a data structure that has the same form regardless of the size of the data. You can easily write …

Sorting and Reversing Link List Introduction To sort a linked list, first we traverse the list searching for the node with a minimum data value. Then we remove that node and append it to another …