# LECTURE NOTES ON

DATA STRUCTURES USING C
Revision 4.0
1 December, 2014

Professor
Department of Computer Science and Engineering

E. KRISHNA RAO PATRO
Associate Professor
Department of Computer Science and Engineering

INSTITUTE OF AERONAUTICAL ENGINEERING

2014-2015

CONTENTS
CHAPTER 1 BASIC CONCEPTS
1.1
1.2
1.3.
1.4.
1.5.
1.6.
1.7.
1.8.
1.9.
1.10.
1.11.

Introduction to Data Structures
Data structures: organizations of data
Selecting a data structure to match the operation
Algorithm
Practical Algorithm design issues
Performance of a program
Classification of Algorithms
Complexity of Algorithms
Rate of Growth
Analyzing Algorithms
Exercises
Multiple Choice Questions

CHAPTER 2 RECURSION
2.1.
2.2.
2.3.
2.4.
2.5.
2.6.
2.7.
2.8.

Introduction to Recursion
Differences between recursion and iteration
Factorial of a given number
The Towers of Hanoi
Fibonacci Sequence Problem
Program using recursion to calculate the NCR of a given number
Program to calculate the least common multiple of a given number
Program to calculate the greatest common divisor
Exercises
Multiple Choice Questions

3.1.
3.2.
3.3.

3.3.1. Source Code for the Implementation of Single Linked List
3.4.
3.5.
3.6.
3.6.1. A Complete Source Code for the Implementation of Double Linked List
3.7.
3.7.1. Source Code for Circular Single Linked List
3.8.
3.8.1. Source Code for Circular Double Linked List
3.9.
3.10. Polynomials
3.10.1. Source code for polynomial creation with help of linked list
Exercise
Multiple Choice Questions

I

CHAPTER 4 STACK AND QUEUE
4.1.

Stack
4.1.1. Representation of Stack
4.1.2. Program to demonstrate a stack, using array
4.1.3. Program to demonstrate a stack, using linked list
4.2.
Algebraic Expressions
4.3.
Converting expressions using Stack
4.3.1. Conversion from infix to postfix
4.3.2. Program to convert an infix to postfix expression
4.3.3. Conversion from infix to prefix
4.3.4. Program to convert an infix to prefix expression
4.3.5. Conversion from postfix to infix
4.3.6. Program to convert postfix to infix expression
4.3.7. Conversion from postfix to prefix
4.3.8. Program to convert postfix to prefix expression
4.3.9. Conversion from prefix to infix
4.3.10. Program to convert prefix to infix expression
4.3.11. Conversion from prefix to postfix
4.3.12. Program to convert prefix to postfix expression
4.4.
Evaluation of postfix expression
4.5.
Applications of stacks
4.6.
Queue
4.6.1. Representation of Queue
4.6.2. Program to demonstrate a Queue using array
4.6.3. Program to demonstrate a Queue using linked list
4.7.
Applications of Queue
4.8.
Circular Queue
4.8.1. Representation of Circular Queue
4.9.
Deque
4.10. Priority Queue
Exercises
Multiple Choice Questions
CHAPTER 5 BINARY TREES
5.1.
5.2.
5.3.

5.4.
5.5.
5.6.
5.7.
5.8.
5.9.

Trees
Binary Tree
Binary Tree Traversal Techniques
5.3.1. Recursive Traversal Algorithms
5.3.2. Building Binary Tree from Traversal Pairs
5.3.3. Binary Tree Creation and Traversal Using Arrays
5.3.4. Binary Tree Creation and Traversal Using Pointers
5.3.5. Non Recursive Traversal Algorithms
Expression Trees
5.4.1. Converting expressions with expression trees
Binary Search Tree
General Trees (m-ary tree)
5.7.1. Converting a m-ary tree (general tree) to a binary tree
Search and Traversal Techniques for m-ary trees
5.8.1. Depth first search
Sparse Matrices
Exercises
Multiple Choice Questions

II

CHAPTER 6 GRAPHS
6.1.
6.2.
6.3.
6.4.
6.5.

Introduction to Graphs
Representation of Graphs
Minimum Spanning Tree
6.3.1. Kruskal’s Algorithm
6.3.2. Prim’s Algorithm
Reachability Matrix
Traversing a Graph
6.5.1. Breadth first search and traversal
6.5.2. Depth first search and traversal
Exercises
Multiple Choice Questions

CHAPTER 7 SEARCHING AND SORTING
7.1.
7.2.
7.3.
7.4.
7.5.
7.6.

7.7.
7.8.

Linear Search
7.1.1. A non-recursive program for Linear Search
7.1.1. A Recursive program for linear search
Binary Search
7.1.2. A non-recursive program for binary search
7.1.3. A recursive program for binary search
Bubble Sort
7.3.1. Program for Bubble Sort
Selection Sort
7.4.1 Non-recursive Program for selection sort
7.4.2. Recursive Program for selection sort
Quick Sort
7.5.1. Recursive program for Quick Sort
Priority Queue and Heap and Heap Sort
7.6.2. Max and Min Heap data structures
7.6.2. Representation of Heap Tree
7.6.3. Operations on heap tree
7.6.4. Merging two heap trees
7.6.5. Application of heap tree
Heap Sort
7.7.1. Program for Heap Sort
Priority queue implementation using heap tree
Exercises
Multiple Choice Questions

Index

III

They have different representations on different computers. In other words. 1. data items appear at various levels. an algorithm terminates after executing a finite number of instructions. Non-primitive data structures. character constants. data structure is represented as: Algorithm + Data structure = Program A data structure is said to be linear if its elements form a sequence or a linear list. An Algorithm is a finite sequence of instructions. each of which has a clear meaning and can be performed with a finite amount of effort in a finite length of time. a data structure defines a way of organizing all data items that considers not only the elements stored but also their relationship to each other. floating point numbers. The linear data structures like an array. Data structures and algorithms are interrelated. The term data structure is used to describe the way data is stored. and the term algorithm is used to describe the way data is processed. of Information Technology . A data structure is said to be non linear if its elements form a hierarchical classification where. They emphasize on grouping same or different data items with relationship between each data item.1 shows the classification of data structures. No matter what the input values may be. Lecture Notes 1 Dept. Trees and Graphs are widely used non-linear data structures. Figure 1. Introduction to Data Structures: Data structure is a representation of logical relationship existing between individual elements of data. Arrays. Graphs are nothing but trees with certain restrictions removed. Data structures are divided into two types: • • Primitive data structures.Chapter 1 Basic Concepts The term data structure is used to describe the way data is stored. Non-primitive data structures are more complicated data structures and are derived from primitive data structures. string constants and pointers come under this category. To develop a program of an algorithm we should select an appropriate data structure for that algorithm. Integers. Tree and graph structures represents hierarchial relationship between individual data elements. queues and linked lists organize data in linear order. Choosing a data structure affects the kind of algorithm you might use. stacks. lists and files come under this category. Therefore. and choosing an algorithm affects the data structures we use.1. Primitive Data Structures are the basic data structures that directly operate upon the machine instructions.

Da t a St r uc t ur e s No n. figure 1. Data structures: Organization of data The collection of data you work with in a program have some kind of structure or organization.3(a) shows an example of an array of numbers. items in a non-contiguous structure and scattered in memory. each element is of the same type. The second kind of contiguous structure is called structure. Since each element in the array is located next to one or two other elements. Lecture Notes 2 Dept. the nodes of the list are linked together using pointers stored in each node. In contiguous structures. The first kind is called the array.L i n e ar L i st s Queues Gr a p h s T re e s F i g ur e 1. No matte how complex your data structures are they can be broken down into two fundamental types: • Contiguous • Non-Contiguous. Figure 1.2 Contiguous and Non-contiguous structures compared Contiguous structures: Contiguous structures can be broken drawn further into two kinds: those that contain data items of all the same size. terms of data are kept together in memory (either RAM or in a file). In contrast. In a struct. Figure 1. An array is an example of a contiguous structure. A linked list is an example of a non-contiguous data structure.3(b) shows a simple structure consisting of a person’s name and age.2. and thus has the same size. elements may be of different data types and thus may have different sizes. Here. but we linked to each other in some way. 1. In an array. 1 2 3 1 (a) Contiguous 2 3 (b) non-contiguous Figure 1. Figure 1.2 below illustrates the difference between contiguous and noncontiguous structures. and those where the size may differ. of Information Technology .2 shows example of each kind. C l a s s if ic at i o n of Da t a St r uc t ur e s 1.Pr i mi t iv e Da t a St r uc t ur e s Pr i mi t iv e Da t a St r uc t ur e s I nt e g er F l o at C h ar P o i nt er s Arr ay s L i st s L i n e ar L i st s St ac k s File s No n.

}. including the non-contiguous forms. A linked list represents a linear. Here. int arr[3] = {1. But his or her name. one-dimension type of non-contiguous structure. “bill the student”}. Non-contiguous structures: Non-contiguous structures are implemented as a collection of data-items. 3 cust_data bill= {21. (a) Array 21 (b) struct “bill the student” Figure 1. Examples of non-contiguous structures Lecture Notes 3 Dept. char name[20].3 Examples of contiguous structures. In a tree each node has only one link that leads into the node and links can only go down the tree.4(b) is an example of a two-dimensional non-contiguous structure. called a graph has no such restrictions. The most general type of non-contiguous structure.4. Couples with the atomic types (that is. A tree such as shown in figure 1. the single data-item built-in types such as integer. there is the notion of up and down and left and right.For example. a person’s age can be represented with a simple integer that occupies two bytes of memory. represented as a string of characters. may require many bytes and may even be of varying length. 2. 3}. Figure 1. where each node can point to one or more other nodes in the collection. The simplest kind of noncontiguous structure is linked list. 1 2 struct cust_data { int age. where there is only the notation of backwards and forwards. arrays and structs provide all the “mortar” you need to built more exotic form of data structure. of Information Technology . called nodes.4(c) is an example of a graph. A B C A B (a) Linked List C D A E B G C F (b) Tree D E F (c) graph G Figure 1. float and pointers).

or how the items are pushed and popped. N[i] holds the index to the next node in the list. For instance. You also need to plan for the way the data will be accessed and processed – that is.5. D[i] holds the data for node i and p[i] holds the index to the node previous to i.3. The pointers are actually nothing more than indexes into the D array.5 shows how to implement a double– linked list using three parallel arrays. Then one part contiguous and another part non-contiguous. Items stored in a stack can only be added and removed in certain order – the last item added is the first item removed. pushing and popping. of Information Technology . figure 1. Like wise. We call these operations. The notion of a data structure in the abstract needs to be treated differently from what ever is used to implement the structure. A double linked list via a hybrid data structure The array D contains the data for the list. if we want to read a file. 1. a stack is a typical abstract data type.arrays and structures – can also be implemented non-contiguously.Hybrid structures: If two basic types of structures are mixed then it is a hybrid form. the structures that are normally treated as contiguously . whereas the array P and N hold the previous and next “pointers’’. We have only specified the valid operations that can be performed. tree and graphs – can be implemented either contiguously or non. So we created what is known Lecture Notes 4 Dept. Considering both the organization of data and the expected operations on the data. where may or may not reside at position i–1. The abstract notion of a data structure is defined in terms of the operations we plan to perform on the data. For example. That is. For example. leads to the notion of an abstract data type. we wrote the code to read the physical file device. A List Head B C (a) Conceptual Structure D P N 1 A 3 4 2 B 4 0 3 C 0 1 4 D 1 2 (b) Hybrid Implementation Figure 1. we may have to write the same code over and over again. non-contiguous structures – including lists. we haven’t specified have items are stored on the stack. Abstract Data Type (ADT): The design of a data structure involves more than just its organization. In this definition. An abstract data type in a theoretical construct that consists of data as well as the operations to be performed on the data while hiding implementation. For example. how the data will be interpreted actually.contiguously like wise. possibly stored a past from each other in memory.

and can be accomplished with some pointer manipulation as illustrated in figure below: A X 200 100 Initial List A C 300 X A Figure 1. the deletion using linked lists will often be faster than when arrays are used. } return. of Information Technology . node *n = q -> next. } if (q) { /* not at end of list. } The process of detecting a node from a list is independent of the type of data stored in the node. but they take up more space because they require two extra pointers per element. each of which has a clear meaning and can be performed with a finite amount of effort in a finite length of time. Algorithm An algorithm is a finite sequence of instructions. Our linked lists yield faster deletions. But is that always true? There are trade offs.5. so detach P by making previous and next nodes point to each other */ node *p = q -> prev. It may seem that linked lists are superior to arrays.i--. No matter what the input values may be.6 Detaching a node from a list Since very little data is moved during this process. Output: at least one quantity is produced. an algorithm terminates after executing a finite number of instructions. In addition every algorithm must satisfy the following criteria: Input: there are zero or more quantities. Lecture Notes 6 Dept. q = q Æ next. if (n) n -> prev = P. which are externally supplied. if (p) p -> next = n. 1.

1. Try to save time (Time complexity). of Information Technology . which never terminates (except for system crashes) but continues in a wait loop until more jobs are entered. In formal computer science. so saving time is an obvious goal. Space Complexity: The space complexity of a program is the amount of memory it needs to run to completion.6. which ultimately determines the size of problems that can be solved by the algorithm. One is analytical. a program that saves space over a competing program is considered desirable. while in performance measurement we conduct experiments. The time complexity of a program is the amount of computer time it needs to run to completion. Try to have face. We use two approaches to determine the performance of a program. We represent an algorithm using pseudo language that is a combination of the constructs of a programming language together with informal English statements. The limiting behavior of the complexity as size increases is called the asymptotic time complexity. 3. Effectiveness: every instruction must be sufficiently basic that it can in principle be carried out by a person using only pencil and paper. Finiteness: if we trace out the instructions of an algorithm. and a program. The space need by a program has the following components: Lecture Notes 7 Dept. Next. will look at some design issues that are broader in scope. One important example of such a program for a computer is its operating system. one distinguishes between an algorithm.Definiteness: each instruction must be clear and unambiguous. Time Complexity: The time needed by an algorithm expressed as a function of the size of a problem is called the TIME COMPLEXITY of the algorithm. A program does not necessarily satisfy the fourth condition. Try to save space (Space complexity). A program that runs faster is a better program. It is not enough that each operation be definite. Performance of a program: The performance of a program is the amount of computer memory and time needed to run a program. 1. then for all cases the algorithm will terminate after a finite number of steps. It is the asymptotic complexity of an algorithm. and the other experimental.7. We want to “save face” by preventing the program from locking up or generating reams of garbled data. 2. Like wise. There are three basic design goals that we should strive for in a program: 1. but it must also be feasible. In performance analysis we use analytical methods. Practical Algorithm design issues: Choosing an efficient algorithm or data structure is just one part of the design process.

This is the optimal situation for an algorithm that must process n inputs. When n is a million. n. such algorithms arise naturally as “brute–force” solutions to problems. but log n does not double until n increases to n2. When n doubles. Lecture Notes 8 Dept. Whenever n doubles. the running time more than doubles. 2n Few algorithms with exponential running time are likely to be appropriate for practical use. Classification of Algorithms If ‘n’ is the number of data items to be processed or degree of polynomial or the size of the file to be sorted or searched or the number of nodes in a graph etc.8. it is generally the case that a small amount of processing is done on each input element. Quadratic running times typically arise in algorithms that process all pairs of data items (perhaps in a double nested loop) whenever n doubles.. an algorithm that process triples of data items (perhaps in a triple– nested loop) has a cubic running time and is practical for use only on small problems. it is practical for use only on relatively small problems. we say that its running time is a constant. • The compiler options in effect at the time of compilation • The target computer. the running time increases four fold. Whenever n doubles. log n This running time arises for algorithms but solve a problem by breaking it up into smaller sub-problems. n3 Similarly. solving them independently. n2 When the running time of an algorithm is quadratic. the program gets slightly slower as n grows. log n is a doubled whenever n doubles. the running time squares. Space needed by dynamically allocated objects such as arrays and class instances. Data space has two components: • • Space needed by constants and simple variables in program. If all the instructions of a program have this property. and then combining the solutions.Instruction space: Instruction space is the space needed to store the compiled version of the program instructions. Data space: Data space is the space needed to store all constant and variable values. log n increases by a constant. Log n When the running time of a program is logarithmic. Environment stack space: The environment stack is used to save information needed to resume execution of partially completed functions. n When the running time of a program is linear. This running time commonly occurs in programs that solve a big problem by transforming it into a smaller problem. 1 Next instructions of most programs are executed once or at most only a few times. Instruction Space: The amount of instructions space that is needed depends on factors such as: • The compiler used to complete the program into machine code. the running time increases eight fold. cutting the size by some constant fraction. of Information Technology . 1.

Big–Theta (Θ) and Little–Oh 1. The function f(n). of Information Technology . says that the growth rate of T(n) equals (=) the growth rate of h(n) [if T(n) = O(h(n)) and T(n) = Ω (h(n)] 4.10. Worst Case : The maximum value of f(n) for any key possible input. says that the growth rate of T(n) is less than the growth rate of p(n) [if T(n) = O(p(n)) and T(n) ≠ Θ (p(n))]. (pronounced order of or big oh). Average Case : The expected value of f(n). Mostly. which is a measure of the quantity of input data. T(n) = O(f(n)). Rate of Growth Big–Oh (O). is known as analysis of algorithms. depends not only on the size ‘n’ of the input data but also on the particular data. gives the running time of an algorithm. Best Case : The minimum possible value of f(n) is called the best case. called the size of the problem. Most often we shall be interested in the rate of growth of the time or space required to solve larger and larger instances of a problem. says that the growth rate of T(n) is less than or equal (<) that of f(n) 2. says that the growth rate of T(n) is greater than or equal to (>) that of g(n) 3. Algorithms can be evaluated by a variety of criteria.1. The field of computer science. The complexity function f(n) for certain cases are: 1. the storage space required by an algorithm is simply a multiple of the data size ‘n’.9. T(n) = o(p(n)) (pronounced little oh). 3. T(n) = Θ(h(n)) (pronounced theta). Big–Omega (Ω). Complexity of Algorithms The complexity of an algorithm M is the function f(n) which gives the running time and/or storage space requirement of the algorithm in terms of the size ‘n’ of the input data. 2. We will associate with the problem an integer. Complexity shall refer to the running time of the algorithm. which studies efficiency of algorithms. T(n) = Ω(g(n)) (pronounced omega). Some Examples: 2n2 2n2 2n2 2n2 + + + + 5n 5n 5n 5n – – – – 6 6 6 6 = = = ≠ O(2n) O(n3) O(n2) O(n) 2n2 2n2 2n2 2n2 + + + + 5n 5n 5n 5n – – – – 6 6 6 6 ≠ ≠ = ≠ Θ(2n) Θ(n3) Θ(n2) Θ(n) 2n2 2n2 2n2 2n2 + + + + 5n 5n 5n 5n – – – – 6 6 6 6 ≠ ≠ = = Ω(2n) Ω(n3) Ω(n2) Ω(n) 2n2 2n2 2n2 2n2 + + + + 5n 5n 5n 5n – – – – 6 6 6 6 = = ≠ ≠ o(2n) o(n3) o(n2) o(n) Lecture Notes 9 Dept. 1.

n2.1. Analyzing Algorithms Suppose ‘M’ is an algorithm. Since Big-Oh is an upper bound. O(n). O(n3). n! and nn Numerical Comparison of Different Algorithms The execution time for six of the typical functions is given below: S. To simplify the analysis. Thus we throw away leading constants.11. but never later. 2n. n log n. the convention will not have any particular units of time. Lecture Notes 10 Dept. of Information Technology . log n n2 n3 2n 1 0 1 1 1 1 2 2 1 2 2 4 8 4 3 2 4 8 16 64 16 4 3 8 24 64 512 256 5 4 16 64 256 4096 65536 Graph of log n. and suppose ‘n’ is the size of the input data. n3. the answer provided is a guarantee that the program will terminate within a certain time period. n! and nn O(log n) does not depend on the base of the logarithm. log2 n). O(n. O(log2 n). We will also throw away low–order terms while computing a Big–Oh running time. The most common computing times are: O(1). O(2n). Clearly the complexity f(n) of M increases as n increases. n. This is usually done by comparing f(n) with some standard functions. It is usually the rate of increase of f(n) we want to examine.No log n n n. The program may stop earlier than this. O(n2).

as the size of the input increases. 9. 10. Exercises 1. So it is always better to prefer a program whose running time with the lower growth rate. So. if the program is to be run mainly on inputs of small size. with constants by proportionality neglected. we would indeed prefer the program whose running time was O(n3) However.One way to compare the function f(n) with these standard function is to use the functional ‘O’ notation. Define best case of an algorithm. the O(n3) program will take significantly more time than the O(n2) program. which is n/20. State the properties of algorithms. Then. 6. 5 n3/100 n2 = n/20 for inputs n < 20. Define average case of an algorithm. 8. suppose f(n) and g(n) are functions defined on the positive integers with the property that f(n) is bounded by some multiple g(n) for almost all ‘n’. Define time complexity of an algorithm? 7. Mention the various spaces utilized by a program. For example. State the various steps in developing algorithms? 3. Therefore. Define worst case of an algorithm. 4. Define efficiency of an algorithm? 5. the ratio of the running times. the order of complexity for: • • • • Linear search is O(n) Binary search is O(log n) Bubble sort is O(n2) Quick sort is O(n log n) For example. the program with running time 5n3 will be faster those the one with running time 100 n2. gets arbitrarily larger. if the first program takes 100n2 milliseconds. State the various methods to estimate the efficiency of an algorithm. 2. as ‘n’ gets large. 5n3 program be better than the 100n2 program. of Information Technology . Thus. The low growth rate function’s such as O(n) or O(n log n) are always better. Then might not 5n3 program better than 100n2 program? As the programs can be evaluated by comparing their running time functions. Define algorithm. While the second taken 5n3 milliseconds. Lecture Notes 11 Dept. f(n) = O(g(n)) Which is read as “f(n) is of order g(n)”.

______ of an algorithm is the amount of time (or the number of steps) needed by a program to complete its task. in less formal language. Cannot be defined B. Dynamic Programming ______ is used to define the worst-case running time of an algorithm. Pseudocode D. Time Complexity D. None [ C ] 3. Dynamic Programming C. Complexity C. Pseudocode D. ______ of a program is the amount of memory used at once by the algorithm until it completes its execution. _____ is a step-by-step recipe for solving an instance of problem. A. State the different memory spaces occupied by an algorithm. B. Big-Oh notation B. A. ______ is used to describe the algorithm. Complexity D. [ C ] [ A ] A. Define space complexity of an algorithm. of Information Technology . Analysis Lecture Notes 12 Dept. Time Complexity [ D ] 4. Natural Language C. Multiple Choice Questions 1. Divide and Conquer D. A.11. Divide and Conquer C. 12. A. Algorithm B. Space Complexity B. Space Complexity 5. Cannot be defined C. Analysis [ A ] 2.

a function must be able to call itself. fact). In this unit we will look at “recursion” as a programmer who not only loves it but also wants to understand it! With a bit of involvement it is going to be an interesting reading for you. } int factorial (int n) { int result. Recursion is the process of defining something in terms of itself. scanf (“%d”. For example. It is because recursion is elegant to use through it is costly in terms of time and space.Chapter 2 Recursion Recursion is deceptively simple in statement but exceptionally complicated in implementation. A non-recursive or iterative version for finding the factorial is as follows: factorial (int n) { int i. fact = factorial (num). main() { int num. Introduction to Recursion: A function is recursive if a statement in the body of the function calls itself. } return (result).h> int factorial (int). But using it is one thing and getting involved with it is another. &num). which computers the factorial of an integer. result = 1. fact. if (n == 0) Lecture Notes 13 Dept. For a computer language to be recursive. 2. else result = n * factorial (n-1). num. if (n == 0) return (1). printf ("\n Factorial of %d =%5d\n". #include <stdio. of Information Technology . Many programmers prefer recursion through simpler alternatives are available. Recursive procedures work fine in many problems. let us consider the function factr() shown below.1. printf (“Enter a positive integer value: ").

2. When writing recursive functions. } return (result).1) ! Lecture Notes Base Case Recursive Case 14 Dept. Only the arguments and variables are new. As each recursive call returns. the recursive function will recurse forever until you run out of stack space and indicate error about lack of memory. Recursion keeps producing simple versions of the original problem until the base case is reached. i<=n. new local variables and parameters are allocated storage on the stack and the function code is executed with these new variables from the start. Both can occur infinitely. Iteration normally occurs within a loop so the extra memory assigned is omitted.3. 2. When a function calls itself. Both involve a termination test. Recursion achieves repetition through repeated function calls. of Information Technology . Iteration keeps modifying the counter until the loop continuation condition fails. i++) result = result * i. 5). Differences between recursion and iteration: • • • Both involve repetition. you must have a exit condition somewhere to force the function to return without the recursive call being executed. It increases the processor’s operating time. Recursion terminates when a base case is recognized. The recursive definition is: n = 0. Recursion causes another copy of the function and hence a considerable memory space’s occupied. Factorial of a given number: The operation of recursive factorial function is as follows: Start out with some natural number N (in our example. 0 ! = 1 n > 0. or stack overflow. Iteration terminates when the loop continuation. else { for (i=1. It reduces the processor’s operating time. } The operation of the non-recursive version is clear as it uses a loop starting at 1 and ending at the target value and progressively multiplies each number by the moving product. If you do not have an exit condition. Iteration Recursion Iteration explicitly user a repetition structure. 2. n ! = n * (n . the old local variables and parameters are removed from the stack and execution resumes at the point of the function call inside the function. A recursive call does not make a new copy of the function.return (result).

and we define factorial N (where N > 0). here is what happens: FUNCTION: Does N = 0? No Function Return Value = 5 * factorial (4) At this time. FUNCTION: Does N = 0? No Function Return Value = 2 * factorial (1) At this time. the function factorial is called again. with N = 2. the function factorial is called again. FUNCTION: Does N = 0? Yes Function Return Value = 1 Lecture Notes 15 Dept. the function factorial is called again. the function factorial is called again. say. with N = 1. FUNCTION: Does N = 0? No Function Return Value = 1 * factorial (0) At this time. All recursive functions must have an exit condition. with N = 3. with N = 0.Recursion Factorials: 5! =5 * 4! = 5 *___ = ____ factr(5) = 5 * factr(4) = __ 4! = 4 *3! = 4 *___ = ___ factr(4) = 4 * factr(3) = __ 3! = 3 * 2! = 3 * ___ = ___ 2! = 2 * 1! = 2 * ___ = ___ factr(3) = 3 * factr(2) = __ factr(2) = 2 * factr(1) = __ 1! = 1 * 0! = 1 * __ = __ factr(1) = 1 * factr(0) = __ 0! = 1 factr(0) = __ 5! = 5*4! = 5*4*3! = 5*4*3*2! = 5*4*3*2*1! = 5*4*3*2*1*0! = 5*4*3*2*1*1 =120 We define 0! to equal 1. FUNCTION: Does N = 0? No Function Return Value = 3 * factorial (2) At this time. Tracing of the flow of the factorial () function: When the factorial function is first called with. of Information Technology . the function factorial is called again. that is a state when it does not recurse upon itself. FUNCTION: Does N = 0? No Function Return Value = 4 * factorial (3) At this time. N = 5. with N = 4. to be N * factorial (N-1). Our exit condition in this example is when N = 0.

we have to trace our way back up! See. the function instances where N = 3. the value 120 is returned.11. And since N = 5 was the first function call (hence the last one to be recalled). or 120 was returned. The rules to be followed in moving the disks from tower 1 tower 3 using tower 2 are as follows: • • • Only one disk can be moved at a time. or 1.4. 1. 24. The next higher function call. Only the top disc on any tower can be moved to any other tower. That is. illustrates the final setup of towers of Hanoi. because that's what the function call where N = 1 returned). 6.1. where N = 2. 3. When When When When N N N N = = = = 2. the function call where N = 1 returns 1*1. 5. when we have N = 2. returns 2 * 1 (1. and 5 are still waiting for their return values. disk 1 has diameter 1 (in some unit of measure). and disk 3 has diameter 3. The game starts with n disks on tower A. The figure 3. Figure 3. The objective of the game is to move all the disks in tower 1 to entire tower 3 using tower 2. So.11. and without loss of generality we may assume that the diameter of each disk is the same as its number. The disks are numbered from 1 to 3. You just keep working up the chain. That is. For simplicity. or 6 was returned. At any function level call. all function level calls above still exist! So. 2. The Towers of Hanoi: In the game of Towers of Hanoi. All three disks start on tower A in the order 1. 2 3 4 5 * * * * 1. disk 2 has diameter 2. A larger disk cannot be placed on a smaller disk. T o w er 1 T o w er 2 T o w er 3 F i g. the factorial function was called six times. 2. once the final call returns 0. and 3. let n is 3. at no time can a larger disk be placed on a smaller disk. or 2 was returned.2. 4. 3. 2. the function call where N = 1 gets retraced first. or 24 was returned. there are three towers labeled 1. So. illustrates the initial setup of towers of Hanoi. 3.Now. 4. I n it i a l s et u p of T o w er s of Ha n o i Lecture Notes 16 Dept. 1 1. of Information Technology . 2.

Now we have the remaining n – 1 disks to be moved to tower 3. To move the largest disk to the bottom of tower 3. char *b. "Tower 2". getch(). } } Lecture Notes 17 Dept. char *c) { if (n == 1) { ++cnt. printf ("\n%5d: Move disk %d from %s to %s". of Information Technology . c). F i n a l s et u p of T o w er s of Ha n o i The towers of Hanoi problem can be easily implemented using recursion. cnt. scanf("%d". } else { towers_of_hanoi (n-1. printf("Enter number of discs: "). ++cnt. int main (void) { int n. a. int cnt=0. printf ("\n%5d: Move disk 1 from %s to %s". we move the remaining n – 1 disks to tower 2 and then move the largest disk to tower 3. b). c. char *a. a. char *a. "Tower 3").T o w er 1 T o w er 2 T o w er 3 F i g 3. towers_of_hanoi (n-1. n. cnt.&n). c). a. towers_of_hanoi (n. char *c). since the disk placed on tower 3 is the largest disk and continue the same operation to place the entire disks in tower 3 in order. 2. return. char *b.h> #include <conio. This can be achieved by using the remaining two towers. c). 1 1. b. "Tower 1".h> void towers_of_hanoi (int n. } void towers_of_hanoi (int n. The program that uses recursion to produce a list of moves that shows how to accomplish the task of transferring the n disks from tower 1 to tower 3 is as follows: #include <stdio. We can also use tower 3 to place any disk on it. a. return.

14: Move disk 2 from tower 1 to tower 3. 3: Move disk 1 from tower 2 to tower 3. 6: Move disk 2 from tower 2 to tower 3. Successive elements in this sequence are obtained by summing the preceding two elements in the sequence. 10: Move disk 2 from tower 2 to tower 1. . Lecture Notes 18 Dept. Fibonacci Sequence Problem: A Fibonacci sequence starts with the integers 0 and 1.Output of the program: RUN 1: Enter the number of discs: 3 1: Move disk 1 from tower 1 to tower 3. 9: Move disk 1 from tower 2 to tower 3. 4: Move disk 3 from tower 1 to tower 3. 12: Move disk 3 from tower 2 to tower 3. RUN 2: Enter the number of discs: 4 1: Move disk 1 from tower 1 to tower 2. 7: Move disk 1 from tower 1 to tower 2. fifth number is 1 + 2 = 3 and so on. . . 15: Move disk 1 from tower 2 to tower 3. 4: Move disk 3 from tower 1 to tower 2. 2. 8: Move disk 4 from tower 1 to tower 3. . 6: Move disk 2 from tower 3 to tower 2. 5: Move disk 1 from tower 2 to tower 1. 11: Move disk 1 from tower 3 to tower 1. . . . third number in the sequence is 0 + 1 = 1. fourth number is 1 + 1= 2. 2: Move disk 2 from tower 1 to tower 3.5. 7: Move disk 1 from tower 1 to tower 3. 2: Move disk 2 from tower 1 to tower 2. of Information Technology . The sequence of Fibonacci integers is given below: 0 1 1 2 3 5 8 13 21 . 5: Move disk 1 from tower 3 to tower 1. 13: Move disk 1 from tower 1 to tower 2. . For example. 3: Move disk 1 from tower 3 to tower 2.

return (x). printf (“=nfib(5) is %d”. int x. { clrscr (). A recursive function to compute the Fibonacci number in the nth position is given below: main() { } fib(n) int n. fib(5)). and fib(3). 2 times in the above calculations.A recursive definition for the Fibonacci sequence of integers may be defined as follows: Fib (n) = n if n = 0 or n = 1 Fib (n) = fib (n-1) + fib (n-2) for n >=2 We will now use the definition to compute fib(5): fib(5) = fib(4) + fib(3) fib(3) + fib(2) + fib(3) fib(2) + fib(1) + fib(2) + fib(3) fib(1) + fib(0) + fib(1) + fib(2) + fib(3) 1 + 0 + 1 + fib(1) + fib(0) + fib(3) 1 + 0 + 1 + 1 + 0 + fib(2) + fib(1) 1 + 0 + 1 + 1 + 0 + fib(1) + fib(0) + fib(1) 1+0 +1 +1+0 +1 +0 +1 =5 We see that fib(2) is computed 3 times. of Information Technology . } Output: fib(5) is 5 Lecture Notes 19 Dept. if (n==0 | | n==1) return n. x=fib(n-1) + fib(n-2). We save the values of fib(2) or fib(3) and reuse them whenever needed.

result). printf (“Enter the limit: “). int r) { if(r == 0) return 1. else return(n * 1. &r). int n.6. void main() { int n. i++) scanf(“%d”. } int alone (int a[]. scanf(“%d %d”. } Output: Enter the value of N and R: 5 The NCR value is: 10. prime. lcm(a. scanf(“%d”. r.h> float ncr (int n. r). 2)). printf(“The NCR value is %. &n. result = ncr(n.0 / r * ncr (n-1. result. for (i = 0.h> int alone(int a[]. n. status. of Information Technology .2. &n). { int k. Program using recursion to calculate the NCR of a given number: #include<stdio. return 1.7. i. int n). } Lecture Notes 20 Dept. int r). int prime). i < n. for (k = 0.00 2. k < n. void main() { int a[20]. printf (“Enter the numbers : “). r-1)). printf(“Enter the value of N and R :”).3f”. printf (“The least common multiple is %ld”. } float ncr (int n. 2 Program to calculate the least common multiple of a given number: #include<stdio. int n). k++) if (a[k] != 1) return 0. &a[i]). long int lcm(int a[]. n.

for (i = 0. 2)). scanf (“%d”. int n. prime)). gcd (a. prime. int n. status = 0. } Output: Enter the limit: 6 Enter the numbers: 6 5 4 3 2 1 The least common multiple is 60 2. i++) if (prime > a[i]) return 1. stat. &n). printf (“Enter the numbers: “). printf (“Enter the limit: “). prime = (prime == 2) ? prime+1 : prime+2)). int prime) { int i. int prime). i. int prime) { int i. a[i] = a[i] / prime. i < n. Program to calculate the greatest common divisor: #include<stdio. int n. } int check_limit (int a[]. for (i = 0. i++) if ((a[i] % prime) == 0) { status = 1. int n. void main() { int a[20]. if (allone(a.long int lcm (int a[]. int n. else return (lcm (a. int check_all (int a[]. i < n. n)) return 1. } Lecture Notes 21 Dept. n. i ++) scanf (“%d”. n. return 0. printf (“The greatest common divisor is %ld”. i < n.h> int check_limit (int a[].8. } if (status == 1) return (prime * lcm(a. int prime). long int gcd (int a[]. n. &a[i]). status. for (i = 0. int prime). n. of Information Technology .

int prime) { int i. Don't use arrays/strings. else return (gcd (a. prime)) return 1. prime = (prime == 2) ? prime+1 : prime+2)). 3. i++) if ((a[i] % prime) != 0) return 0. Write a function using Recursion to print numbers from n to 0. for (i = 0.int check_all (int a[]. if (check_limit(a. Lecture Notes 22 Dept. Write a function using Recursion to enter and display a string in reverse and state whether the string contains any spaces. int n. Write a function with one positive integer parameter called n. Which method is preferable in general? a) Recursive method b) Non-recursive method 5. if (check_all (a. Here are the patterns of output for various values of n: n=1: n=2: n=3: n=4: Output Output Output Output is: is: is: is: 1 121 1213121 121312141213121 And so on. n. int n. 6. return 1. n. of Information Technology . n. followed by a second copy of the output for n-1. i < n. Note that the output for n always consists of the output for n-1. followed by n itself. The function will write 2^n-1 integers (where ^ is the exponentiation operation). Write a recursive function for the mathematical function: f(n) = 1 if n = 1 f(n) = 2 * f(n-1) if n >= 2 4. What is the importance of the stopping case in recursive functions? 2. n. i++) a[i] = a[i] / prime. } Output: Enter the limit: 5 Enter the numbers: 99 55 22 The greatest common divisor is 11 77 121 Exercises 1. } long int gcd (int a[]. prime)) return (prime * gcd (a. i < n. prime)). for (i = 0. int prime) { int i.

Write a function using Recursion to check if a number n is prime. In a single function declaration. number).”). } } What values of number are directly handled by the stopping case? A. super_write_vertical(100) D. n (where n is the argument) D. else { super_write_vertical(number/10). number < 10 C. super_write_vertical(-1023) B. Multiple Choice Questions 1. What is the maximum depth of recursive calls a function may make? A. The function should return the depth at which the space was encountered. super_write_vertical(1023) [ ] Lecture Notes 23 Dept. super_write_vertical(abs(number)). printf(“%d\n”. (You have to check whether n is divisible by any number below n) 8. } else if (number < 10) printf(“%d\n”. number >= 0 && number < 10 D. number % 10). Write a function using Recursion to enter characters one by one until a space is encountered.”). super_write_vertical (abs(number)). super_write_vertical(0) C. else { super_write_vertical(number/10). 1 B. Consider the following function: void super_write_vertical(int number) { if (number < 0) { printf(“ . number % 10). There is no fixed maximum [ ] 2. of Information Technology . 2 C. 1 B. number > 10 [ ] 4. 2 C. There is no fixed maximum [ ] 3. n (where n is the argument) D. number). Consider the following function: void super_write_vertical (int number) { if (number < 0) { printf(“ . printf(“%d\n”. } } Which call will result in the most recursive calls? A. } else if (number < 10) printf(“%d\n”. number < 0 B.7. what is the maximum number of statements that may be recursive calls? A.

B. 7 D. } How many asterisks are printed by the function call quiz(5)? A. B. Diagonalization. [ ] Lecture Notes 24 Dept. Current depth of recursion. C. which information is not saved in the activation record? A. of Information Technology . 4 C. Location where the function should return when done. Local variables [ ] 9. Consider this function declaration: [ ] void quiz (int i) { if (i > 1) { quiz(i / 2). Mathematical induction. When the compiler compiles your program. quiz(i / 2). What technique is often used to prove the correctness of a recursive function? A. The results are non-deterministic D. The operating system detects the infinite recursion because of the "repeated state" B. When a function call is executed. Matrix Multiplication. what will happen if you make a recursive call without making the problem smaller? A. Formal parameters. 8 6. } printf(“ * ”). There is no duplication of local variables D. 3 B. D.5. how is a recursive call treated differently than a non-recursive function call? A. D. Parameters are all treated as value arguments C. Communitivity. The program keeps running until you press Ctrl-C C. C. halting the program [ ] 7. In a real computer. None of the above [ ] 8. The run-time stack overflows. Parameters are all treated as reference arguments B.

free() is the opposite of malloc(), which de-allocates memory. The argument to free()
is a pointer to a block of memory in the heap — a pointer which was obtained by a
malloc() function. The syntax is:
free (ptr);
The advantage of free() is simply memory management when we no longer need a
block.
3.1.

A linked list is a non-sequential collection of data items. It is a dynamic data structure.
For every data item in a linked list, there is an associated pointer that would give the
memory location of the next data item in the linked list.
The data items in the linked list are not in consecutive memory locations. They may be
anywhere, but the accessing of these data items is easier as each data item contains
the address of the next data item.
1.
2.
3.
4.

Linked lists are dynamic data structures. i.e., they can grow or shrink during
the execution of a program.
Linked lists have efficient memory utilization. Here, memory is not preallocated. Memory is allocated whenever it is required and it is de-allocated
(removed) when it is no longer needed.
Insertion and Deletions are easier and efficient. Linked lists provide flexibility
in inserting a data item at a specified position and deletion of the data item
from the given position.
Many complex applications can be easily carried out with linked lists.

1.
2.
3.2.

It consumes more space because every node requires a additional pointer to
store address of the next node.
Searching a particular element in list is difficult and also time consuming.

Basically we can put linked lists into the following four items:
1.

2.

3.

4.

A single linked list is one in which all nodes are linked together in some sequential
manner. Hence, it is also called as linear linked list.

Lecture Notes

26

Dept. of Information Technology

A double linked list is one in which all nodes are linked together by multiple links which
helps in accessing both the successor node (next node) and predecessor node
(previous node) from any arbitrary node within the list. Therefore each node in a
double linked list has two link fields (pointers) to point to the left node (previous) and
the right node (next). This helps to traverse in forward direction and backward
direction.
A circular linked list is one, which has no beginning and no end. A single linked list can
field of the last node.
A circular double linked list is one, which has both the successor pointer and
predecessor pointer in the circular manner.
Comparison between array and linked list:
ARRAY

Size of an array is fixed

Size of a list is not fixed

Memory is allocated from stack

Memory is allocated from heap

It is necessary to specify the number of
elements during declaration (i.e., during
compile time).

It is not necessary to specify the
number of elements during declaration
(i.e., memory is allocated during run
time).
It occupies more memory.

It occupies less memory than a linked
list for the same number of elements.
Inserting new elements at the front is
potentially expensive because existing
elements need to be shifted over to
make room.
Deleting an element from an array is
not possible.

Inserting a new element at any position
can be carried out easily.
Deleting an element is possible.

FEATURE

ARRAYS

Sequential access

efficient

efficient

Random access

efficient

inefficient

Resigning

inefficient

efficient

Element rearranging

inefficient

efficient

none

Lecture Notes

27

Dept. of Information Technology

1.

Linked lists are used to represent and manipulate polynomial. Polynomials are
expression containing terms with non zero coefficient and exponents. For
example:
P(x) = a0 Xn + a1 Xn-1 + …… + an-1 X + an

2.

Represent very large numbers and operations of the large number such as

3.

Linked lists are to implement stack, queue, trees and graphs.

4.

Implement the symbol table in compiler construction

3.3.

A linked list allocates space for each element separately in its own block of memory
called a "node". The list gets an overall structure by using pointers to connect all its
nodes together like the links in a chain. Each node contains two fields; a "data" field to
store whatever element, and a "next" field which is a pointer used to link to the next
node. Each node is allocated in the heap using malloc(), so the node memory
continues to exist until it is explicitly de-allocated using free(). The front of the list is a
pointer to the “start” node.
A single linked list is shown in figure 3.2.1.
STACK

HEAP

100
start
The start
pointer holds
of the first
node of the
list.

10

200

100
Each node stores
the data.

20

300

200

30
300

Stores the next

400

40

X

400
The next field of the
last node is NULL.

The beginning of the linked list is stored in a "start" pointer which points to the first
node. The first node contains a pointer to the second node. The second node contains a
pointer to the third node, ... and so on. The last node in the list has its next field set to
NULL to mark the end of the list. Code can access any node in the list by starting at the
start and following the next pointers.
The start pointer is an ordinary local pointer variable, so it is drawn separately on the
left top to show that it is in the stack. The list nodes are drawn on the right to show
that they are allocated in the heap.

Lecture Notes

28

Dept. of Information Technology

Before writing the code to build the above list, we need to create a start node, used to
create and access other nodes in the linked list. The following structure definition will
do (see figure 3.2.2):

Creating a structure with one data item and a next pointer, which will be
pointing to next node of the list. This is called as self-referential structure.

Initialise the start pointer to be NULL.

{
int data;
};

node:

data

next

start
Empty list:

node *start = NULL;

NULL

Figure 3.2.2. Structure definition, single link node and empty list

The basic operations in a single linked list are:

Creation.

Insertion.

Deletion.

Traversing.

Creating a node for Single Linked List:
Creating a singly linked list starts with creating a node. Sufficient memory has to be
allocated for creating a node. The information is stored in the memory, allocated by
using the malloc() function. The function getnode(), is used for creating a node, after
allocating memory for the structure of type node, the information for the item (i.e.,
data) has to be read from the user, set next field to NULL and finally returns the
address of the node. Figure 3.2.3 illustrates the creation of a node for single linked list.

node* getnode()
{
node* newnode;
newnode = (node *) malloc(sizeof(node));
printf("\n Enter data: ");
scanf("%d", &newnode -> data);
newnode -> next = NULL;
return newnode;
}

newnode

10

X

100

Figure 3.2.3. new node with a value of 10

Lecture Notes

29

Dept. of Information Technology

Single Linked List with 4 nodes The function createlist().4 shows 4 items in a single linked list stored at different locations in memory. • If the list is not empty. newnode = getnode().> ne xt ! = N U L L) te m p = t e m p . Repeat the above steps ‘n’ times. • If the list is empty. • The start pointer is made to point the new node by assigning the address of the new node. no d e * ne w no d e. start 100 10 100 200 20 300 200 30 400 300 40 X 400 Figure 3. start = newnode. of Information Technology . start node) in the list by assigning the address of the first node. } } } Lecture Notes 30 Dept.4.2. w hile(t e m p . i < n . fo r( i = 0. Figure 3.Creating a Singly Linked List with ‘n’ number of nodes: The following steps are to be followed to create ‘n’ number of nodes: • Get the new node using getnode().> ne xt = ne w no d e. no d e *t e m p .e. follow the steps given below: • • The next field of the new node is made to point the first node (i. is used to create ‘n’ number of nodes: vo id c r e at e list( int n) { int i. } e ls e { te m p = st a rt. te m p . if(st a rt = = N U L L) { sta rt = ne w no d e.> ne xt. i+ + ) { ne w no d e = g et no d e(). assign new node as start.2.

Figure 3. start = newnode.2. The new node will contain empty data field and empty next field.5. } else { newnode -> next = start. is used for inserting a node at the beginning void insert_at_beg() { node *newnode.5 shows inserting a node into the single linked list at the beginning. of Information Technology . • If the list is empty then start = newnode. newnode = getnode(). • Inserting a node at the end. Memory is to be allocated for the new node (in a similar way that is done while creating a list) before reading the data.Insertion of a Node: One of the most primitive operations that can be done in a singly linked list is the insertion of a node. } } Lecture Notes 31 Dept. follow the steps given below: newnode -> next = start. • If the list is not empty. Inserting a node at the beginning The function insert_at_beg(). The data field of the new node is then stored with the information read from the user. start = newnode. newnode = getnode(). start 500 10 100 5 200 20 300 200 30 400 300 40 X 400 100 500 Figure 3.2. The new node can then be inserted at three different places namely: • Inserting a node at the beginning. The next field of the new node is assigned to NULL. Inserting a node at the beginning: The following steps are to be followed to insert a new node at the beginning of the list: • Get the new node using getnode(). if(start == NULL) { start = newnode. • Inserting a node at intermediate position.

Lecture Notes 32 Dept. if(start == NULL) { start = newnode. of Information Technology . *temp. • If the list is not empty follow the steps given below: temp = start. } else { temp = start.6. while(temp -> next != NULL) temp = temp -> next. The function insert_at_end(). temp -> next = newnode.Inserting a node at the end: The following steps are followed to insert a new node at the end of the list: • Get the new node using getnode() newnode = getnode().2. Inserting a node at the end. • If the list is empty then start = newnode.2. is used for inserting a node at the end. start 100 10 100 200 20 300 200 30 40 400 300 500 400 50 X 500 Figure 3. newnode = getnode(). Figure 3. } } Inserting a node at intermediate position: The following steps are followed. while(temp -> next != NULL) temp = temp -> next. temp -> next = newnode. to insert a new node in an intermediate position in the list: • Get the new node using getnode(). void insert_at_end() { node *newnode. newnode = getnode().6 shows inserting a node into the single linked list at the end.

temp = temp -> next. int pos. newnode -> next = temp. ctr++. if(pos > 1 && pos < nodectr) { temp = prev = start. newnode = getnode(). } prev -> next = newnode.2. scanf("%d". pos). • Store the starting address (which is in start pointer) in temp and prev pointers. newnode -> next = temp. This is done by countnode() function. nodectr. start prev temp 100 10 100 200 20 500 200 30 400 300 50 500 40 X 400 300 new node Figure 3.• Ensure that the specified position is in between first node and last node.2. Inserting a node at an intermediate position. void insert_at_mid() { node *newnode. } } Lecture Notes 33 Dept. &pos). of Information Technology . *temp. The function insert_at_mid(). *prev. Figure 3. ctr = 1. nodectr = countnode(start). follow the steps given below: prev -> next = newnode.7 shows inserting a node into the single linked list at a specified intermediate position other than beginning and end. is used for inserting a node in the intermediate position. • Let the intermediate position be 3. printf("\n Enter the position: "). Then traverse the temp pointer upto the specified position followed by prev pointer. } else { printf("position %d is not a middle position". If not. specified position is invalid. • After reaching the specified position.7. while(ctr < pos) { prev = temp.

free(temp). • Deleting a node at intermediate position."). Memory is to be released for the node to be deleted. • Deleting a node at the end.. Deleting a node at the beginning.8 shows deleting a node at the beginning of a single linked list. free(temp). • Deleting a node at the beginning. } else { temp = start. Figure 3. start 200 10 temp 100 200 20 300 200 30 400 300 40 X 400 Figure 3. start = temp -> next.8. Deleting a node at the beginning: The following steps are followed. printf("\n Node deleted "). start = start -> next.2. is used for deleting the first node in the list. • If the list is not empty. } } Lecture Notes 34 Dept.Deletion of a node: Another primitive operation that can be done in a singly linked list is the deletion of a node. of Information Technology . return . if(start == NULL) { printf("\n No nodes are exist. to delete a node at the beginning of the list: • If list is empty then display ‘Empty List’ message. A node can be deleted from the list from three different places namely. void delete_at_beg() { node *temp.2. The function delete_at_beg(). follow the steps given below: temp = start.

printf("\n Node deleted "). Deleting a node at the end..2. } prev -> next = NULL. prev = start.Deleting a node at the end: The following steps are followed to delete a node at the end of the list: • If list is empty then display ‘Empty List’ message. Figure 3. follow the steps given below: temp = prev = start. free(temp). void delete_at_last() { node *temp. The function delete_at_last(). temp = temp -> next. start 100 10 100 200 20 300 200 X 30 300 40 X 400 Figure 3. free(temp).9 shows deleting a node at the end of a single linked list. • If the list is not empty.9. } prev -> next = NULL. if(start == NULL) { printf("\n Empty List. is used for deleting the last node in the list. while(temp -> next != NULL) { prev = temp. return . while(temp -> next != NULL) { prev = temp."). temp = temp -> next. of Information Technology . } } Lecture Notes 35 Dept. *prev.2. } else { temp = start.

is used for deleting the intermediate node in the list. } else { printf("\n Enter position of node to delete: "). pos.10 shows deleting a node at a specified intermediate position other than beginning and end from a single linked list. } Lecture Notes 36 Dept. while(ctr < pos) { prev = temp.2.10. printf("\n node deleted. of Information Technology .Deleting a node at Intermediate position: The following steps are followed. follow the steps given below. scanf("%d"..2. if(pos > nodectr) { printf("\nThis node doesnot exist")."). if(pos > 1 && pos < nodectr) { temp = prev = start. Deleting a node at an intermediate position. • If list is empty then display ‘Empty List’ message • If the list is not empty. &pos). return . } Figure 3. void delete_at_mid() { int ctr = 1. if(start == NULL) { printf("\n Empty List. nodectr. start 100 10 100 300 20 300 200 30 400 300 40 X 400 Figure 3. The function delete_at_mid(). ctr++. free(temp). temp = temp -> next. to delete a node from an intermediate position in the list (List must contain more than two node). nodectr = countnode(start). } prev -> next = temp -> next. ctr = 1."). node *temp. *prev..

node by node from the first node."). printf("\n Node deleted.. } prev -> next = temp -> next. else { while (temp != NULL) { printf("%d ->". if(start == NULL ) printf("\n Empty List"). The function rev_traverse(). • Display the information from the data field of each node.. Traversing a list involves the following steps: • Assign the address of start pointer to a temp pointer. printf("\n The contents of List (Left to Right): \n"). Lecture Notes 37 Dept. getch().if(pos > 1 && pos < nodectr) { temp = prev = start. while(ctr < pos) { prev = temp. temp = temp -> next. temp -> data). } } printf("X"). That is in reverse order. of Information Technology . temp = start. } Alternatively there is another way to traverse and display the information. temp = temp -> next. void traverse() { node *temp. free(temp). you have to traverse (move) a linked list. until the end of the list is reached. } } } Traversal and displaying a list (Left to Right): To display the information. } else { printf("\n Invalid position."). is used for traversing and displaying the information stored in the list from right to left. ctr ++. The function traverse() is used for traversing and displaying the information stored in the list from left to right.

h> struct slinklist { int data. printf("\n--------------------------").> ne xt).Traverse the list (Left to Right)"). printf("\n 5. int menu() { int ch.Insert a node at beginning "). clrscr(). printf("\n--------------------------"). struct slinklist *next. typedef struct slinklist node. of Information Technology . printf("\n 3. printf("\n 8. Source Code for the Implementation of Single Linked List: # include <stdio. st . } e ls e { r e v_t r a v e rs e(st .h> # include <stdlib.> " . printf("\n 1.Create a list ").vo id r e v_t r a v e rs e( no d e *st) { if(st = = N U L L) { r et ur n. Lecture Notes 38 Dept. printf("\n--------------------------"). printf("\n 4. p r intf(" % d .h> # include <conio.> ne xt)).Insert a node at middle"). } } Counting the Number of Nodes: The following code will count the number of nodes exist in the list using recursion. printf("\n 6. printf("\n 7.Delete a node from Last").Delete a node from Middle").> d at a). printf("\n 9.Traverse the list (Right to Left)"). int co unt no d e( no d e *st) { if(st = = N U L L) r et ur n 0. }.Delete a node from beginning").3. e ls e r et ur n(1 + co unt no d e(st . printf("\n 2. } 3. node *start = NULL.Insert a node at end").1.

scanf("%d". if(start == NULL) { start = newnode. Exit "). for(i = 0. i < n.printf("\n--------------------------"). printf("\n The contents of List (Left to Right): \n"). while(temp -> next != NULL) temp = temp -> next. scanf("%d". } else { temp = start. &newnode -> data). } node* getnode() { node * newnode. } void createlist(int n) { int i. temp -> next = newnode. } } } void traverse() { node *temp. } return (count). while(ptr != NULL) { count++. ptr = ptr -> next. temp = start. return. node *temp. printf("\n Enter data: "). Count nodes "). return newnode. node *newnode. printf("\n 11. of Information Technology . printf("\n 10. newnode -> next = NULL. i++) { newnode = getnode(). } else { Lecture Notes 39 Dept. return ch. printf("\n\n Enter your choice: "). } int countnode(node *ptr) { int count=0. if(start == NULL) { printf("\n Empty List").&ch). newnode = (node *) malloc(sizeof(node)).

while(temp -> next != NULL) temp = temp -> next. printf("\n Enter the position: "). *temp. &pos). } } void insert_at_mid() { node *newnode. Lecture Notes 40 Dept. } } } printf(" X "). ctr = 1. start -> data). } } void insert_at_end() { node *newnode. if(start == NULL) { start = newnode. } } void insert_at_beg() { node *newnode. scanf("%d". temp -> data). } else { temp = start. if(start == NULL) { start = newnode. *temp. nodectr = countnode(start). int pos. } else { rev_traverse(start -> next). of Information Technology . } else { newnode -> next = start. newnode = getnode(). start = newnode. nodectr. printf("%d -->". temp = temp -> next. void rev_traverse(node *start) { if(start == NULL) { return. *prev. newnode = getnode(). newnode = getnode(). temp -> next = newnode.while(temp != NULL) { printf("%d-->".

} } void delete_at_last() { node *temp. of Information Technology . printf("\n Node deleted "). if(start == NULL) { printf("\n No nodes are exist.. } else { temp = start. start = temp -> next. void delete_at_beg() { node *temp. pos. temp = temp -> next. free(temp). free(temp). nodectr.. } else printf("position %d is not a middle position".} if(pos > 1 && pos < nodectr) { temp = prev = start. } prev -> next = NULL. if(start == NULL) { printf("\n Empty List."). while(ctr < pos) { prev = temp. Lecture Notes 41 Dept. temp = temp -> next. while(temp -> next != NULL) { prev = temp. ctr++. } else { temp = start."). *prev. newnode -> next = temp. } } void delete_at_mid() { int ctr = 1. return . printf("\n Node deleted ")."). pos). prev = start. *prev. return . node *temp.. } prev -> next = newnode. if(start == NULL) { printf("\n Empty List.

n. break. ctr ++. break. printf("\n Node deleted. while(ctr < pos) { prev = temp. break.. free(temp). Lecture Notes 42 Dept.")."). temp = temp -> next. printf("\n Enter position of node to delete: ").} else { } } return . &n). if(pos > nodectr) { printf("\nThis node doesnot exist").. scanf("%d". } prev -> next = temp -> next. while(1) { ch = menu(). break. } void main(void) { int ch. switch(ch) { case 1: if(start == NULL) { printf("\n Number of nodes you want to create: "). case 4: insert_at_mid(). } if(pos > 1 && pos < nodectr) { temp = prev = start. clrscr(). printf("\n List created.. } else { printf("\n Invalid position. createlist(n). } else printf("\n List is already created."). getch(). case 2: insert_at_beg(). case 3: insert_at_end()."). scanf("%d". nodectr = countnode(start).. of Information Technology . &pos).

printf(" X "). node n can never be the first node in the list. break.4. break. having a header node can simplify the code that adds a node before a given node n. break. Lecture Notes 43 Dept. Similarly. } getch(). Using a header node: A header node is a special dummy node found at the front of the list. there is no need for the special case code given above for the remove operation. case 9: } 3. The use of header node is an alternative to remove the first node in a list. case 11 : exit(0). countnode(start)). case 10: printf("\n No of nodes : %d ". break. } printf("\n The contents of List (Right to Left): \n"). delete_at_mid(). delete_at_last(). break.case 5: case 6: case 7: case 8: delete_at_beg(). For example. 20 and 30 would be represented using a linked list without and with a header node: sta rt 100 10 200 100 20 300 200 X 30 300 Si n g l e L i n k e d L i st w it h o ut a h e a d er n o d e sta rt 400 100 400 10 200 100 20 300 200 30 X 300 Si n g l e L i n k e d L i st w it h h e a d er n o d e Note that if your linked lists do include a header node. traverse(). so there is no need to check for that case. break. rev_traverse(start). the picture below shows how the list with data 10. of Information Technology .

> r ig ht. no d e * ne w no d e.3.> r ig ht) te m p = t e m p . } e ls e { te m p = st a rt.Creating a Double Linked List with ‘n’ number of nodes: The following steps are to be followed to create ‘n’ number of nodes: • Get the new node using getnode().3 shows 3 items in a double linked list stored at different locations.> left = t e m p . i+ + ) { ne w no d e = g et no d e(). no d e *t e m p . • If the list is not empty. of Information Technology . if(st a rt = = N U L L) { sta rt = ne w no d e. } } } Figure 3. fo r( i = 0. i < n. • The previous nodes right field must be assigned with address of the new node. ne w no d e . is used to create ‘n’ number of nodes: vo id c r e at e list( int n) { int i.4. start 100 X 100 10 200 100 20 300 200 200 30 X 300 Figure 3. Repeat the above steps ‘n’ times. newnode =getnode().> r ig ht = ne w no d e. te m p . Double Linked List with 3 nodes Lecture Notes 46 Dept. w hile(t e m p .4. • If the list is empty then start = newnode. follow the steps given below: • • The left field of the new node is made to point the previous node. The function createlist().

follow the steps given below: newnode -> right = start.4. • If the list is not empty.5 shows inserting a node into the double linked list at the end. of Information Technology .4. start 400 400 10 200 100 X 40 100 20 300 200 200 30 X 300 100 400 Figure 3. Inserting a node at the beginning Inserting a node at the end: The following steps are followed to insert a new node at the end of the list: • Get the new node using getnode() newnode=getnode(). is used for inserting a node at the end. • If the list is not empty follow the steps given below: temp = start.Inserting a node at the beginning: The following steps are to be followed to insert a new node at the beginning of the list: • Get the new node using getnode(). temp -> right = newnode. newnode -> left = temp. • If the list is empty then start = newnode. start -> left = newnode. • If the list is empty then start = newnode. The function dbl_insert_beg(). Figure 3. Figure 3.4.4 shows inserting a node into the double linked list at the beginning. Lecture Notes 47 Dept. The function dbl_insert_end(). start = newnode. newnode=getnode().4. is used for inserting a node at the beginning. while(temp -> right != NULL) temp = temp -> right.

follow the steps given below: newnode -> left = temp. • After reaching the specified position. Inserting a node at an intermediate position Lecture Notes 48 Dept. specified position is invalid.6. of Information Technology .4. newnode -> right = temp -> right. Then traverse the temp pointer upto the specified position followed by prev pointer. newnode=getnode(). If not.4.5. Figure 3. temp -> right -> left = newnode. is used for inserting a node in the intermediate position. • Store the starting address (which is in start pointer) in temp and prev pointers.4. Inserting a node at the end Inserting a node at an intermediate position: The following steps are followed.6 shows inserting a node into the double linked list at a specified intermediate position other than beginning and end. • Ensure that the specified position is in between first node and last node. The function dbl_insert_mid(). temp -> right = newnode. to insert a new node in an intermediate position in the list: • Get the new node using getnode().start 100 X 10 200 100 100 20 300 200 200 30 400 40 X 300 300 400 Figure 3. start 100 100 400 X 10 400 40 200 400 20 300 200 100 200 30 X 300 Figure 3. This is done by countnode() function.

7. of Information Technology . The function dbl_delete_last(). follow the steps given below: temp = start.6 shows deleting a node at the beginning of a double linked list. Deleting a node at the end Lecture Notes 49 Dept. free(temp). to delete a node at the beginning of the list: • If list is empty then display ‘Empty List’ message. free(temp). start 100 X 100 10 200 100 20 X 200 200 30 X 300 Figure 3.7 shows deleting a node at the end of a double linked list.4.4. Deleting a node at beginning Deleting a node at the end: The following steps are followed to delete a node at the end of the list: • If list is empty then display ‘Empty List’ message • If the list is not empty.6. } temp -> left -> right = NULL. is used for deleting the first node in the list. The function dbl_delete_beg(). Figure 3. • If the list is not empty. start -> left = NULL.Deleting a node at the beginning: The following steps are followed.4. is used for deleting the last node in the list. Figure 3. follow the steps given below: temp = start. while(temp -> right != NULL) { temp = temp -> right. start 200 X 10 200 100 X 20 200 300 200 30 X 300 Figure 3. start = start -> right.4.

specified position is invalid. to delete a node from an intermediate position in the list (List must contain more than two nodes). Figure 3. node by node from the first node.8 shows deleting a node at a specified intermediate position other than beginning and end from a double linked list. • If the list is not empty. free(temp).4. • Then perform the following steps: if(pos > 1 && pos < nodectr) { temp = start..8 Deleting a node at an intermediate position Traversal and displaying a list (Left to Right): To display the information. is used for deleting the intermediate node in the list. i++. of Information Technology . follow the steps given below: Lecture Notes 50 Dept.Deleting a node at Intermediate position: The following steps are followed. } The function delete_at_mid(). The function traverse_left_right() is used for traversing and displaying the information stored in the list from left to right. until the end of the list is reached. start 100 X 100 10 300 100 20 300 200 100 30 X 300 Figure 3.4. printf("\n node deleted. while(i < pos) { temp = temp -> right. you have to traverse the list. The following steps are followed. } temp -> right -> left = temp -> left. • Ensure that the specified position is in between first node and last node. to traverse a list from left to right: • If list is empty then display ‘Empty List’ message. • If list is empty then display ‘Empty List’ message. temp -> left -> right = temp -> right. • If the list is not empty. follow the steps given below: • Get the position of the node to delete. If not. i = 1.").

A Complete Source Code for the Implementation of Double Linked List: #include <stdio.h> struct dlinklist { struct dlinklist *left. of Information Technology .h> #include <conio. until the end of the list is reached.temp = start. } Traversal and displaying a list (Right to Left): To display the information from right to left.> r ig ht )). int co unt no d e( no d e *st a rt) { if(st a rt = = N U L L) r et ur n 0. • If the list is not empty. while(temp != NULL) { print temp -> data. node by node from the first node. } 3. The function traverse_right_left() is used for traversing and displaying the information stored in the list from right to left. node *start = NULL. temp = temp -> right. The following steps are followed. temp = temp -> left. Lecture Notes 51 Dept. to traverse a list from right to left: • If list is empty then display ‘Empty List’ message. } Counting the Number of Nodes: The following code will count the number of nodes exist in the list (using recursion). }. typedef struct dlinklist node. int data. follow the steps given below: temp = start. while(temp != NULL) { print temp -> data. while(temp -> right != NULL) temp = temp -> right.5. struct dlinklist *right. e ls e r et ur n(1 + co unt no d e(st a rt .h> #include <stdlib. you have to traverse the list.

printf("\n------------------------------"). printf("\n 2. scanf("%d". printf("\n\n Enter your choice: "). for(i = 0. Insert a node at end"). printf("\n Enter data: "). printf("\n 3. return ch. return newnode. printf("\n------------------------------").Create"). printf("\n 9. if(start == NULL) start = newnode. Insert a node at middle"). } int countnode(node *start) { if(start == NULL) return 0. newnode -> left = NULL. node *newnode. while(temp -> right) temp = temp -> right. of Information Technology .Exit "). printf("\n 10. else return 1 + countnode(start -> right). printf("\n 4. Insert a node at beginning "). printf("\n 8. temp -> right = newnode. printf("\n 6. } int menu() { int ch. printf("\n 5. else { temp = start. i++) { newnode = getnode(). &ch). node *temp. Traverse the list from Left to Right "). &newnode -> data). Delete a node from beginning"). i < n. Delete a node from Middle"). newnode = (node *) malloc(sizeof(node)). Traverse the list from Right to Left "). scanf("%d". printf("\n------------------------------").Count the Number of nodes in the list"). printf("\n 11.node* getnode() { node * newnode. printf("\n 7. clrscr(). newnode -> left = temp. Delete a node from Last"). newnode -> right = NULL. printf("\n------------------------------"). printf("\n 1. } void createlist(int n) { int i. } } } Lecture Notes 52 Dept.

else { temp = start.void traverse_left_to_right() { node *temp. } } } void traverse_right_to_left() { node *temp. while(temp -> right != NULL) temp = temp -> right. start -> left = newnode. else { while(temp != NULL) { printf("\t %d ". if(start == NULL) start = newnode. printf("\n The contents of List: "). of Information Technology . printf("\n The contents of List: "). *temp. temp = temp -> right. start = newnode. else { while(temp -> right != NULL) temp = temp -> right. newnode -> left = temp. temp -> data). temp -> data). } while(temp != NULL) { printf("\t%d". if(start == NULL) printf("\n Empty List"). if(start == NULL ) printf("\n Empty List"). if(start == NULL) start = newnode. temp -> right = newnode. } } Lecture Notes 53 Dept. temp = start. newnode = getnode(). } } void dll_insert_beg() { node *newnode. temp = temp -> left. } } void dll_insert_end() { node *newnode. else { newnode -> right = start. newnode = getnode(). temp = start.

return . } else { temp = start.. if(start == NULL) { printf("\n Empty list"). ctr = 1. nodectr = countnode(start). } void dll_delete_beg() { node *temp. newnode = getnode(). } newnode -> left = temp. pos). &pos). return . while(temp -> right != NULL) Lecture Notes 54 Dept."). } } void dll_delete_last() { node *temp. start -> left = NULL. int pos. free(temp). printf("\n Enter the position: "). if(pos . getch(). while(ctr < pos . start = start -> right. } else printf("position %d of list is not a middle position ". ctr++. temp -> right -> left = newnode.1) { temp = temp -> right. getch(). } else { temp = start. of Information Technology . temp -> right = newnode. } if(pos > 1 && pos < nodectr) { temp = start.*temp. scanf("%d". nodectr. newnode -> right = temp -> right. if(start == NULL) { printf("\n Empty list").void dll_insert_mid() { node *newnode.nodectr >= 2) { printf("\n Position is out of range. return.

} } } void main(void) { int ch. node *temp. i = 1. } if(pos > 1 && pos < nodectr) { temp = start."). scanf("%d". nodectr = countnode(start).. switch( ch) { case 1 : printf("\n Enter Number of nodes to create: "). free(temp). } else { printf("\n It is not a middle position. getch(). n.} } temp = temp -> right. nodectr. scanf("%d". i++. return. } temp -> right -> left = temp -> left. while(i < pos) { temp = temp -> right. getch(). if(pos > nodectr) { printf("\nthis node does not exist"). Lecture Notes 55 Dept. } else { printf("\n Enter the position of the node to delete: "). of Information Technology . if(start == NULL) { printf("\n Empty List"). &n). void dll_delete_mid() { int i = 0. pos. return.. free(temp). while(1) { ch = menu()."). printf("\n node deleted. temp = NULL. getch(). createlist(n). temp -> left -> right = NULL. clrscr(). &pos). temp -> left -> right = temp -> right.

while(temp -> next != NULL) temp = temp -> next. newnode = getnode(). Traversing. • If the list is not empty. last -> next = start. The function createlist(). newnode -> next = start. Creating a circular single Linked List with ‘n’ number of nodes: The following steps are to be followed to create ‘n’ number of nodes: • Get the new node using getnode(). start = newnode. newnode = getnode(). • If the list is empty. Lecture Notes 57 Dept. is used to create ‘n’ number of nodes: Inserting a node at the beginning: The following steps are to be followed to insert a new node at the beginning of the circular list: • Get the new node using getnode(). • newnode -> next = start. of Information Technology . follow the steps given below: last = start. while(last -> next != start) last = last -> next.The basic operations in a circular single linked list are: • • • • Creation. assign new node as start. start = newnode. Deletion. assign new node as start. start = newnode. • If the list is not empty. Insertion. • Repeat the above steps ‘n’ times. newnode -> next = start. temp -> next = newnode. follow the steps given below: temp = start. • If the list is empty.

while(temp -> next != start) temp = temp -> next.2.6. Figure 3. Figure 3.6. The function cll_insert_end(). start 100 10 100 200 20 300 200 30 40 400 300 500 400 50 100 500 Figure 3. • If the list is empty.6. assign new node as start.3 shows inserting a node into the circular single linked list at the end. Inserting a node at the beginning Inserting a node at the end: The following steps are followed to insert a new node at the end of the list: • Get the new node using getnode(). • If the list is not empty follow the steps given below: temp = start.The function cll_insert_beg(). Lecture Notes 58 Dept.6. is used for inserting a node at the end. start 500 10 200 100 5 20 300 200 30 40 400 300 500 400 100 500 Figure 3.3 Inserting a node at the end. newnode -> next = start. start = newnode. is used for inserting a node at the beginning. newnode = getnode().2 shows inserting a node into the circular single linked list at the beginning. newnode -> next = start. of Information Technology . temp -> next = newnode.

to delete a node at the beginning of the list: • If the list is empty. last -> next = start. • If the list is not empty. follow the steps given below: last = temp = start. while(last -> next != start) last = last -> next. of Information Technology . follow the steps given below: temp = start. while(temp -> next != start) { prev = temp. • After deleting the node. is used for deleting the last node in the list. • If the list is not empty. start = start -> next. • After deleting the node. Figure 3.6. if the list is empty then start = NULL. Deleting a node at the end: The following steps are followed to delete a node at the end of the list: • If the list is empty. The function cll_delete_last(). Lecture Notes 59 Dept. temp = temp -> next. Deleting a node at beginning. display a message ‘Empty List’.4. if the list is empty then start = NULL. display a message ‘Empty List’. The function cll_delete_beg(). prev = start.4 shows deleting a node at the beginning of a circular single linked list.6. } prev -> next = start. is used for deleting the first node in the list. start 200 10 temp 200 100 20 300 200 30 40 400 300 200 400 Figure 3.Deleting a node at the beginning: The following steps are followed.

node* getnode() { node * newnode.h> # include <conio.1. scanf("%d".6.5 shows deleting a node at the end of a circular single linked list. of Information Technology . Source Code for Circular Single Linked List: # include <stdio. newnode = (node *) malloc(sizeof(node)). typedef struct cslinklist node. } while(temp != start). temp -> data). newnode -> next = NULL. 3.5. node *start = NULL.Figure 3. printf("\n Enter data: ").h> # include <stdlib. temp = temp -> next. do { printf("%d ". to traverse a list from left to right: • If list is empty then display ‘Empty List’ message. • If the list is not empty. }. &newnode -> data). return newnode.7. Deleting a node at the end.6. struct cslinklist *next. } Lecture Notes 60 Dept. int nodectr.h> struct cslinklist { int data. Traversing a circular single linked list from left to right: The following steps are followed. start 100 10 200 100 20 300 200 30 100 300 40 100 400 Figure 3. follow the steps given below: temp = start.

Exit"). Delete a node from Middle"). printf("\n 3. printf("\n\n--------------------------"). temp = temp -> next. node *temp. } } Lecture Notes 61 Dept. temp -> next = newnode. else { do { printf("\t %d ". if(start == NULL) { start = newnode. temp -> data). } void createlist(int n) { int i. } else { temp = start. Display the list"). temp = start. clrscr(). } while(temp != start). printf("\n\n--------------------------"). printf("\n 5. nodectr = n. for(i = 0. i++) { newnode = getnode().int menu() { int ch. Create a list "). printf("\n\n--------------------------"). Delete a node from Last"). printf("\n 9. printf("\n 6. /* last node is pointing to starting node */ } void display() { node *temp. node *newnode. while(temp -> next != NULL) temp = temp -> next. if(start == NULL ) printf("\n Empty List"). Insert a node at end"). printf(" X "). &ch). i < n . printf("\n\n--------------------------"). Delete a node from beginning"). printf("\n The contents of List (Left to Right): "). return ch. printf("\n 7. Insert a node at middle"). printf("\n 8. Insert a node at beginning "). printf("\n 1. of Information Technology . printf("\n Enter your choice: "). printf("\n 4. scanf("%d". printf("\n 2. } } newnode ->next = start.

*temp. start = newnode. } void cll_insert_mid() { node *newnode. prev = temp. while(last -> next != start) last = last -> next. scanf("%d". while(temp -> next != start) temp = temp -> next."). newnode -> next = temp. int i. } else { last = start. } else { temp = start. Lecture Notes 62 Dept. newnode -> next = start. &pos). } printf("\n Node inserted at end. newnode -> next = start. newnode -> next = start.. } prev -> next = newnode. newnode = getnode(). if(pos > 1 && pos < nodectr) { temp = start. i = 1. *last. printf("\n Enter the position: "). } void cll_insert_end() { node *newnode. while(i < pos) { prev = temp. temp -> next = newnode. temp = temp -> next. *temp. } printf("\n Node inserted at beginning. newnode -> next = start. nodectr++.void cll_insert_beg() { node *newnode. last -> next = start. newnode = getnode(). if(start == NULL) { start = newnode. nodectr++. pos ."). *prev. newnode = getnode(). i++.. if(start == NULL ) { start = newnode. of Information Technology .

free(temp)."). } prev -> next = start. } else { } printf("position %d of list is not a middle position ". nodectr--. printf("\n Node deleted. if(nodectr == 0) start = NULL. *last.. if(start == NULL) { printf("\n No nodes exist. if(start == NULL) { printf("\n No nodes exist. start = start -> next.*prev. while(last -> next != start) last = last -> next. prev = start. of Information Technology . free(temp). nodectr--."). return . } else { last = temp = start. } void cll_delete_beg() { node *temp.. } else { temp = start. return . while(temp -> next != start) { prev = temp. getch().").. printf("\n Node inserted at middle. last -> next = start..")."). } } void cll_delete_last() { node *temp. if(nodectr == 0) start = NULL. temp = temp -> next. pos). printf("\n Node deleted. } } Lecture Notes 63 Dept..nodectr++. getch().

while(1) { ch = menu(). prev = start. } Lecture Notes 64 Dept. i = 0. free(temp).void cll_delete_mid() { int i = 0. *prev.")..."). node *temp. scanf("%d". n. int ch. } if(start == NULL) { printf("\n No nodes exist. if(pos > nodectr) { printf("\nThis node does not exist"). &pos). &n). scanf("%d". while(i < pos . of Information Technology . printf("\n Node Deleted."). return .1) { prev = temp. return. } prev -> next = temp -> next. getch(). } if(pos > 1 && pos < nodectr) { temp=start. } } void main(void) { int result. temp = temp -> next . i++. getch().. nodectr--. clrscr(). printf("\nList created.. createlist(n). } else { printf("\n It is not a middle position. getch(). } else { printf("\n Which node to delete: "). pos. switch(ch) { case 1 : if(start == NULL) { printf("\n Enter Number of nodes to create: ").").

Figure 3. start -> left->right = newnode. newnode ->right = start.Creating a Circular Double Linked List with ‘n’ number of nodes: The following steps are to be followed to create ‘n’ number of nodes: • Get the new node using getnode().8.8. newnode -> right = start. newnode = getnode(). then start = newnode. • If the list is empty. follow the steps given below: newnode -> left = start -> left. is used for inserting a node at the beginning. • If the list is not empty. newnode -> right = start. of Information Technology . start = newnode. • If the list is not empty. then do the following start = newnode. is used to create ‘n’ number of nodes: Inserting a node at the beginning: The following steps are to be followed to insert a new node at the beginning of the list: • Get the new node using getnode(). start -> left -> right = newnode. The function cdll_createlist(). • If the list is empty. • Repeat the above steps ‘n’ times. start -> left = newnode. start -> left = newnode.2 shows inserting a node into the circular double linked list at the beginning. follow the steps given below: newnode -> left = start -> left.2. newnode -> left = start. newnode -> left = start. newnode -> right = start. newnode=getnode(). The function cdll_insert_beg(). Inserting a node at the beginning Lecture Notes 66 Dept. start 400 400 100 300 40 10 200 100 20 300 200 200 30 400 300 100 400 Figure 3.

newnode -> right = start.8. • If the list is not empty follow the steps given below: newnode -> left = start -> left.3. then start = newnode. • If the list is empty.8. newnode -> right = start. • Store the starting address (which is in start pointer) in temp. of Information Technology . • After reaching the specified position. newnode -> left = start.3 shows inserting a node into the circular linked list at the end. start -> left -> right = newnode. newnode=getnode(). Lecture Notes 67 Dept. temp -> right = newnode. follow the steps given below: newnode -> left = temp. nodectr++. • Ensure that the specified position is in between first node and last node. Then traverse the temp pointer upto the specified position. start -> left = newnode. temp -> right -> left = newnode. specified position is invalid. to insert a new node in an intermediate position in the list: • Get the new node using getnode(). This is done by countnode() function. The function cdll_insert_end(). start 100 400 100 10 200 100 20 200 300 200 30 400 300 300 40 100 400 Figure 3. is used for inserting a node at the end. Figure 3. If not.Inserting a node at the end: The following steps are followed to insert a new node at the end of the list: • Get the new node using getnode() newnode=getnode(). Inserting a node at the end Inserting a node at an intermediate position: The following steps are followed. newnode -> right = temp -> right.

4 shows inserting a node into the circular double linked list at a specified intermediate position other than beginning and end. The function cdll_delete_beg().4. start = start -> right. start -> left = temp -> left. to delete a node at the beginning of the list: • If list is empty then display ‘Empty List’ message. follow the steps given below: Lecture Notes 68 Dept.5. of Information Technology . Figure 3. start 200 300 10 100 200 300 20 300 200 200 30 200 300 Figure 3.8. Inserting a node at an intermediate position Deleting a node at the beginning: The following steps are followed. is used for inserting a node in the intermediate position.5 shows deleting a node at the beginning of a circular double linked list. follow the steps given below: temp = start.8. temp -> left -> right = start. • If the list is not empty.The function cdll_insert_mid().8. Deleting a node at beginning Deleting a node at the end: The following steps are followed to delete a node at the end of the list: • • If list is empty then display ‘Empty List’ message If the list is not empty. is used for deleting the first node in the list. start 100 100 40 200 400 300 10 400 400 100 20 300 30 100 200 200 300 Figure 3. Figure 3.8.

to delete a node from an intermediate position in the list (List must contain more than two node). } The function cdll_delete_mid(). If not. i++. nodectr--. } temp -> right -> left = temp -> left. temp -> left -> right = temp -> right. The function cdll_delete_last(). Deleting a node at the end Deleting a node at Intermediate position: The following steps are followed. start 100 200 100 10 200 100 20 100 200 200 30 100 300 Figure 3.6 shows deleting a node at the end of a circular double linked list.8. } temp -> left -> right = temp -> right. printf("\n node deleted. • Then perform the following steps: if(pos > 1 && pos < nodectr) { temp = start. temp -> right -> left = temp -> left. of Information Technology . • If the list is not empty. • If list is empty then display ‘Empty List’ message. while(i < pos) { temp = temp -> right . follow the steps given below: • Get the position of the node to delete."). i = 1. • Ensure that the specified position is in between first node and last node.. specified position is invalid. Lecture Notes 69 Dept. while(temp -> right != start) { temp = temp -> right. free(temp).8.6. is used for deleting the last node in the list. Figure 3. is used for deleting the intermediate node in the list.temp = start.

temp = temp -> right.h> # include <stdlib.1. of Information Technology . print temp -> data. Print temp -> data.7. • If the list is not empty. Deleting a node at an intermediate position Traversing a circular double linked list from left to right: The following steps are followed. follow the steps given below: temp = start. to traverse a list from right to left: • If list is empty then display ‘Empty List’ message.h> Lecture Notes 70 Dept. The function cdll_display_right_left(). temp = temp -> right. 3. Source Code for Circular Double Linked List: # include <stdio.7 shows deleting a node at a specified intermediate position other than beginning and end from a circular double linked list. while(temp != start) { print temp -> data. do { temp = temp -> left. start 100 300 100 10 300 100 20 100 300 200 30 100 300 Figure 3. to traverse a list from left to right: • If list is empty then display ‘Empty List’ message.8. • If the list is not empty. } while(temp != start).h> # include <conio. Traversing a circular double linked list from right to left: The following steps are followed.8. follow the steps given below: temp = start. is used for traversing from right to left. is used for traversing from left to right. } The function cdll_display_left _right().Figure 3.8.

Lecture Notes 71 Dept. printf("\n 10. }. Insert a node at End"). Insert a node at Middle"). clrscr(). if(start == NULL) { start = newnode. int data. Display the list from Right to Left"). return newnode. printf("\n 4. printf("\n 9. Delete a node from Middle"). printf("\n\n Enter your choice: "). node* getnode() { node * newnode. return ch. &ch). if(start == NULL) { nodectr = n. printf("\n Enter data: "). scanf("%d". Delete a node from End"). i < n. newnode -> left = start. printf("\n 2. scanf("%d". } else { newnode -> left = start -> left. newnode -> right = NULL. newnode ->right = start. typedef struct cdlinklist node. printf("\n\n--------------------------"). printf("\n 1. *temp. int nodectr. Display the list from Left to Right"). printf("\n 3. newnode = (node *) malloc(sizeof(node)). Create "). printf("\n 7. for(i = 0. Delete a node from Beginning").Exit"). &newnode -> data). Insert a node at Beginning"). newnode -> left = NULL. printf("\n\n--------------------------"). printf("\n 8. } void cdll_createlist(int n) { int i. printf("\n\n--------------------------"). node *newnode. of Information Technology .struct cdlinklist { struct cdlinklist *left. node *start = NULL. printf("\n 6. printf("\n 5. } int menu() { int ch. struct cdlinklist *right. i++) { newnode = getnode().

temp -> data). } while(temp != start). temp = temp -> right. temp = start. temp -> data). printf("\n List already exists. newnode -> right = start. if(start == NULL) printf("\n Empty List"). of Information Technology . while(temp != start) { printf(" %d ". start -> left = newnode. temp -> data). temp = start. temp = temp -> right.. start -> left = newnode.} else } } } newnode -> right = start. printf("\t%d"."). newnode -> right = start. do { temp = temp -> left. else { printf("\n The contents of List: "). } else { newnode -> left = start -> left. start -> left -> right = newnode. newnode = getnode(). Lecture Notes 72 Dept. nodectr++. if(start == NULL) { start = newnode. else { printf("\n The contents of List: "). } } } void cdll_display_right_left() { node *temp. start -> left->right = newnode. if(start == NULL) printf("\n Empty List"). void cdll_display_left_right() { node *temp. newnode -> left = start. printf(" %d ". } } void cdll_insert_beg() { node *newnode.

start -> left -> right = newnode. &pos). pos).nodectr >= 2) { printf("\n Position is out of range. } newnode -> left = temp.1) { temp = temp -> right. nodectr++. while(ctr < pos . printf("\n Enter the position: "). ctr = 1. of Information Technology . Lecture Notes 73 Dept. ctr++. newnode -> right = start. newnode -> right = start. } void cdll_insert_mid() { node *newnode. newnode = getnode(). } printf("\n Node Inserted at End"). *temp. printf("\n Node Inserted at Middle. temp -> right -> left = newnode. if(pos .*temp.} start = newnode. nodectr++.. "). temp -> right = newnode. return. int pos. } else { newnode -> left = start -> left. } if(pos > 1 && pos <= nodectr) { temp = start.")."). newnode -> left = start. scanf("%d".. } else printf("position %d of list is not a middle position". if(start == NULL) { start = newnode. } } void cdll_delete_beg() { node *temp. newnode = getnode().. newnode -> right = temp -> right. if(start == NULL) { printf("\n No nodes exist. start -> left = newnode. *prev. } void cdll_insert_end() { node *newnode.

pos. } Lecture Notes 74 Dept."). getch().."). } else { nodectr--. if(start == NULL) { printf("\n No nodes exist. } else { temp = start. } else { temp = start. if( start == NULL) { printf("\n No nodes exist. start = NULL. temp -> left -> right = start. free(temp). } else { } } nodectr--. start -> left = temp -> left. return . } printf("\n Node deleted from end ")."). if(nodectr == 0) { free(start). while(temp -> right != start) temp = temp -> right. } printf("\n Node deleted at Beginning. start = start -> right. return. temp -> left -> right = temp -> right. start = NULL.getch(). node *temp. free(temp). temp -> right -> left = temp -> left. if(nodectr == 0) { free(start). getch(). of Information Technology . return. } } void cdll_delete_mid() { int ctr = 1. void cdll_delete_last() { node *temp...

. break."). nodectr--. getch(). free(temp). break. getch(). Lecture Notes 75 Dept. if(pos > nodectr) { printf("\nThis node does not exist"). cdll_createlist(n).n. } else { printf("\n It is not a middle position. break. while(1) { ch = menu(). case 6 : cdll_delete_last(). printf("\n node deleted. } if(pos > 1 && pos < nodectr) { temp = start. while(ctr < pos) { temp = temp -> right ."). break. case 4 : cdll_insert_mid(). return. printf("\n List created. case 5 : cdll_delete_beg().. &n).else { printf("\n Which node to delete: "). break. break. &pos). switch( ch) { case 1 : printf("\n Enter Number of nodes to create: "). scanf("%d". case 3 : cdll_insert_end(). clrscr(). of Information Technology . } } } void main(void) { int ch. case 2 : cdll_insert_beg()."). ctr++. scanf("%d". } temp -> right -> left = temp -> left.. temp -> left -> right = temp -> right.

1. int expo. }.&tmp->expo). struct link *next. 77 Dept. return tmp. fflush(stdin).h> #include <malloc.&tmp->coef). printf("\n Enter Exponent : ").10.h> struct link { float coef. of Information Technology . fflush(stdin). Source code for polynomial creation with help of linked list: #include <conio. typedef struct link node. } } Lecture Notes } return p.1. if( p == NULL ) p = newnode. node *temp. scanf("%f". node * getnode() { node *tmp. printf("\n Enter Coefficient : "). while( 1 ) { printf ("\n Do U Want polynomial node (y/n): "). scanf("%d". tmp->next = NULL.10.start Coefficient 500 5 4 100 500 Exponent -8 100 3 200 2 200 2 300 4 1 300 400 9 0 X 400 Figure 3. Single Linked List for the polynomial F(x) = 5x4 – 8x 3 + 2x 2 + 4x 1 + 9x 0 3. } node * create_poly (node *p ) { char ch. newnode = getnode(). while(temp->next != NULL ) temp = temp->next. if(ch == 'n') break.h> #include <stdio.*newnode. else { temp = p. tmp =(node *) malloc( sizeof(node) ). temp->next = newnode. ch = getche().

return tmp. while (t != NULL) { printf("+ %.*newnode. scanf("%f". while( 1 ) { printf ("\n Do U Want polynomial node (y/n): "). } void display (node *p) { node *t = p.&tmp->coef). if(ch == 'n') break. scanf("%d". } node * create_poly (node *p ) { char ch. of Information Technology . tmp->next = NULL. while(1) { if( p1 == NULL || p2 == NULL ) break.2f". newnode = getnode(). } else { if(p1->expo < p2->expo) Lecture Notes 79 Dept. } } void add_poly(node *p1. fflush(stdin). if( p == NULL ) p = newnode. t = t -> next. printf("\n Enter Coefficient : "). p1 = p1->next.p1->coef+p2->coef.p1->expo). if(p1->expo == p2->expo ) { printf("+ %. printf("X^ %d". printf("\n Enter Exponent : "). } } return p. p2 = p2->next. t -> coef).2f X ^%d". ch = getche().&tmp->expo). t -> expo). while(temp->next != NULL ) temp = temp->next. temp->next = newnode. fflush(stdin).tmp =(node *) malloc( sizeof(node) ). else { temp = p.node *p2) { node *newnode. node *temp.

….. } } while(p1 != NULL ) { printf("+ %.. printf("\nEnter Second Polynomial.p1->expo). clrscr(). l4.. printf("\n Enter Polynomial 2: "). } void main() { node *poly1 = NULL .2f X ^%d". } Exercise 1. display (poly2). printf("\n Enter Polynomial 1: "). Write a “C” function to delete a node pointed to by “p” from a single linked list “L”.p2->expo). display (poly1). …. 4.p2->coef. Write a “C” functions to split a given list of integers represented by a single linked list into two lists in the following way.{ } else { } printf("+ %.. l1. Write a “C” function to insert a node “t” before a node pointed to by “X” in a single linked list “L”.p1->coef.).2f X ^%d". add_poly(poly1.. poly2). l3.) and R2 = (l1. p1 = p1->next. The resultant lists would be R1 = (l0. Lecture Notes 80 Dept. of Information Technology . l0. poly1 = create_poly (poly1).(in ascending-order of exponent)"). l5. clrscr(). } while(p2 != NULL ) { } printf("+ %...ln) is represented by a single linked list. display (poly3).p2->expo). …. poly2 = create_poly (poly2).. It is required to append the list L = (ln. Suppose that an ordered list L = (l0. l1. getch().p2->coef.. Let the list be L = (l0. p2 = p2->next. printf("\nEnter First Polynomial.p1->coef. l1. ln) after another ordered list M represented by a single linked list.2f X ^%d".p1->expo). printf(" + %.*poly3=NULL.(in ascending-order of exponent)"). l2. …. p2 = p2->next.. ln).*poly2 = NULL. p1 = p1->next.2f X ^%d". …. 3. 2. printf( "\n Resultant Polynomial : ").

for (ctr=1. D. X -> bwd -> fwd = X -> bwd. [ B ] Lecture Notes 83 Dept. if it is assumed that X points to the last element of the list and ctr is the variable which counts the number of elements in the list? A. for (ctr=1. X != NULL. [ C ] 12. ctr++) X = X -> fwd. X -> fwd != NULL. C. X -> fwd -> fwd = X -> fwd [ B ] 11. X -> bwd -> bwd = X -> fwd. X != NULL. for (ctr=1. X -> bwd != NULL. ctr++) X = X -> bwd. X -> bwd -> fwd = X -> bwd. ctr++) X = X -> bwd.A. of Information Technology . X -> fwd -> bwd = X -> fwd C. start -> bwd = NULL. Which among the following segment of code counts the number of elements in the double linked list. Which among the following segment of code deletes the element pointed to by X from the double linked list. start = X -> fwd. for (ctr=1. C. for (ctr=1. X != NULL. if it is assumed that X points to the first element of the list and start pointer points to beginning of the list? A. if it is assumed that X points to the first element of the list and ctr is the variable which counts the number of elements in the list? A. [ A ] 13. X != NULL. ctr++) X = X -> bwd. for (ctr=1. ctr++) X = X -> fwd. X -> bwd = X -> fwd. X -> fwd -> bwd = X -> bwd B. X -> fwd -> fwd = X -> bwd D. B. X -> fwd -> bwd = X -> bwd. C. X -> fwd != NULL. X -> fwd = X -> bwd B. B. ctr++) X = X -> fwd. X -> fwd -> fwd = X -> fwd 10. D. C. Which among the following segment of code counts the number of elements in the double linked list. ctr++) X = X -> bwd. Which among the following segment of code deletes the element pointed to by X from the double linked list. X -> bwd -> fwd = X -> fwd. for (ctr=1. X -> fwd = NULL D. X -> bwd != NULL. start = X -> fwd. ctr++) X = X -> fwd. if it is assumed that X points to the last element of the list? A. for (ctr=1. B. X -> bwd -> bwd = X -> bwd. X -> fwd -> bwd = NULL. D. X -> bwd -> bwd = X -> bwd. X -> bwd -> fwd = NULL.

X -> bwd -> fwd = X -> fwd. X -> fwd -> bwd = X -> bwd B. Lecture Notes 84 Dept. temp -> bwd = X -> fwd. start -> bwd = X. A. C. 16. start -> bwd = X. B. X ->fwd = x X ->fwd->bwd = temp D. D. X -> bwd -> bwd = X -> bwd. X -> bwd -> fwd = X -> bwd. The start pointer points to beginning of the list? [ B ] [ C ] [ D ] A. X -> bwd = temp. temp ->fwd = X. X -> bwd = X -> bwd. X -> fwd = temp -> fwd. X -> fwd = start. start = X. Which among the following segments of inserts a new node pointed by X to be inserted at any position (i. X -> fwd -> bwd = X. X -> fwd = X -> bwd. X -> fwd = last. X -> bwd = X -> fwd. X -> bwd = last. X -> fwd -> bwd = X -> fwd C. D.14. X -> fwd = X -> bwd B. X -> fwd = start. X -> bwd = X -> fwd.e neither first nor last) element of the double linked list? Assume temp pointer points to the previous position of new node. X -> fwd = X -> bwd. Which among the following segment of code inserts a new node pointed by X to be inserted at the beginning of the double linked list. temp -> fwd = X. Which among the following segments of inserts a new node pointed by X to be inserted at the end of the double linked list. X -> fwd -> fwd = X -> fwd 15. The start and last pointer points to beginning and end of the list respectively? A. C. of Information Technology . X -> bwd = X -> fwd. start = X. last -> fwd = X.

free(X). 18. X = start -> next. if it is assumed that X points to neither the first nor last element of the list? prev pointer points to previous element. C. D X -> next = prev. free(prev). free(start). A single linked list is declared as follows: struct sllist { struct sllist *next. free(X). prev -> next = X -> next. 19. free(prev). X -> next = NULL. X = X -> next. Lecture Notes 85 Dept. if it is assumed that X points to the last element of the list and prev pointer points to last but one element? A. if it is assumed that X points to the first element of the list and start pointer points to beginning of the list? A. B. } Where next represents links to adjacent elements of the list. free(prev). A. free(X). D. free(start). X -> next = prev-> next. B. Which among the following segment of code deletes the element pointed to by X from the single linked list. C. X -> next = prev -> next. C. B. prev -> next = NULL. start = X -> next. free(X). of Information Technology . [ A ] [ B ] [ C ] Which among the following segments of code deletes the element pointed to by X from the single linked list. prev -> next = X -> next. free(X). Which among the following segment of code deletes the element pointed to by X from the single linked list. free(prev). int data.17. D. prev -> next = NULL. start = X. free(X). start = start -> next.

B. X -> next = NULL. ctr++) X = X -> next. D. if it is assumed that X points to the first element of the list and ctr is the variable which counts the number of elements in the list? [ A ] [ B ] [ C ] [ D ] A. prev -> next = X -> next. start -> next = X. X -> next = start. for (ctr=1. prev -> next = X. ctr--) X = X -> next. of Information Technology . X -> next = NULL. prev -> next = X -> next. X -> next = start. start = X C. X -> next = start -> next. X -> next != NULL. C.e neither first nor last) element of the single linked list? Assume prev pointer points to the previous position of new node. X != NULL. ctr++) X = X -> next. Which among the following segments of inserts a new node pointed by X to be inserted at the end of the single linked list. prev -> next = X. X -> next != NULL. C. D. B. X = prev -> next. X = start. Which among the following segment of code counts the number of elements in the single linked list. Which among the following segment of code inserts a new node pointed by X to be inserted at the beginning of the single linked list. Lecture Notes 86 Dept. X != NULL. last -> next = X.20. for (ctr=1. X -> next = start. 23. A. Which among the following segments of inserts a new node pointed by X to be inserted at any position (i. B. for (ctr=1. 21. X -> next = prev -> next. start = X -> next 22. ctr--) X = X -> next. last ->next = NULL. last -> next = X -> next. for (ctr=1. X -> next = prev -> next. X -> next = prev. The start pointer points to beginning of the list? A. C. D. B. The start and last pointer points to beginning and end of the list respectively? A. last -> next = X. X -> next = last. start = X D.

start = start -> fwd. X -> fwd -> fwd= X -> bwd. X -> fwd -> fwd = X -> bwd. } Where fwd and bwd represents forward and backward links to adjacent elements of the list. X -> fwd -> bwd = X -> bwd. X -> bwd -> bwd = X -> fwd. X -> bwd -> fwd = X -> bwd. B. X -> bwd -> fwd = start. start = start -> bwd. B. X -> fwd -> bwd= X -> fwd. int data. D. start = start -> bwd. X -> bwd -> fwd = X -> fwd. X -> fwd -> fwd = X -> bwd. D. start = start -> fwd.24. X -> fwd -> fwd = X -> fwd. X -> fwd -> bwd = X -> bwd. X -> bwd -> fwd = X. if it is assumed that X points to the last element of the list and start pointer points to beginning of the list? A. C. of Information Technology . X -> fwd -> bwd = X -> fwd. X -> bwd -> fwd = X -> fwd. if it is assumed that X points to the first element of the list and start pointer points to beginning of the list? A. A circular double linked list is declared as follows: struct cdllist { struct cdllist *fwd. C. start -> bwd = X -> fwd C. 25. *bwd. [ A ] [ D ] [ B ] Which among the following segments of code deletes the element pointed to by X from the circular double linked list. start -> bwd = X -> bwd. B. Lecture Notes 87 Dept. X -> bwd -> bwd = X -> bwd. Which among the following segment of code deletes the element pointed to by X from the circular double linked list. X -> bwd -> fwd = X -> fwd. X -> fwd -> fwd = start. if it is assumed that X points to neither the first nor last element of the list? A. X -> bwd -> bwd = X -> bwd. X -> bwd -> bwd = X -> fwd. start -> bwd = X -> bwd D. 26. Which among the following segment of code deletes the element pointed to by X from the circular double linked list. start -> bwd = X -> bwd. X -> bwd -> bwd = start.

X != NULL. X -> fwd = start -> fwd. X -> fwd = temp -> fwd. X -> fwd = start -> fwd. ctr++) X = X -> fwd. Which among the following segment of code counts the number of elements in the circular double linked list. ctr++) X = X -> bwd. -> bwd = X. [ D ] Lecture Notes 88 Dept. X -> X -> start start start bwd = start -> bwd. X = start. temp -> fwd = X. X-> fwd = start. Which among the following segment of code inserts a new node pointed by X to be inserted at the end of the circular double linked list. start -> bwd = X. C. =X D. The start pointer points to beginning of the list? A. for (ctr=1. of Information Technology . temp -> fwd = X. X -> bwd = start. start -> bwd = X. X -> fwd -> bwd = X -> fwd. start -> bwd -> fwd = X. D. start -> fwd-> fwd = X. start -> fwd = X. temp -> bwd = X -> fwd. B. start -> bwd-> fwd = X. The start pointer points to beginning of the list? A. X -> fwd -> bwd = X -> bwd. fwd = start. X -> bwd -> fwd = X -> fwd. start = X start = X [ B ] B. [ A ] 28. C. X -> fwd = start. start -> bwd -> fwd = X. X -> bwd -> fwd = X -> bwd. X -> fwd = X. X -> bwd = start. for (ctr=1. X -> fwd = start -> bwd.27. for (ctr=1. for (ctr=1. start = X [ C ] 30. C. X -> bwd != NULL. X->fwd != start. X -> fwd != NULL. if it is assumed that X and start points to the first element of the list and ctr is the variable which counts the number of elements in the list? A. X -> bwd = start -> bwd.e neither first nor last) element of the circular double linked list? Assume temp pointer points to the previous position of new node. ctr++) X = X -> fwd. start -> bwd-> fwd = X. 29. X = start. start -> fwd = X. start -> bwd = X. X -> bwd = start -> bwd. start = X D. Which among the following segment of code inserts a new node pointed by X to be inserted at the beginning of the circular double linked list. -> bwd-> fwd = X. X -> fwd -> bwd = temp. start -> bwd = X. A. X -> bwd = start. X -> fwd -> bwd = X. X -> fwd = start. start -> fwd-> fwd = X. X -> fwd = start. Which among the following segments of inserts a new node pointed by X to be inserted at any position (i. start -> bwd = X. X -> bwd = temp. X -> bwd= start -> bwd. X -> bwd = start -> bwd. C. start -> bwd -> fwd = X. ctr++) X = X -> bwd. B. B. D.

. STACK: A stack is a list of elements in which an element may be inserted or deleted only at one end. When an element is added to a stack. Similarly. The two basic operations associated with stacks are: • Push: is the term used to insert an element into a stack. If we attempt to add new element beyond the maximum size. If such is the case. not in the middle. 4. called the top of the stack. • Queue. Lecture Notes 89 Dept. • Pop: is the term used to delete an element from a stack.1 shows the creation of a stack and addition of elements using push(). Two of such data structures that are useful are: • Stack. of Information Technology .1. “Push” is the term used to insert an element into a stack. we will encounter a stack overflow condition. All insertions and deletions take place at the same end. the operation is performed by push().e. The number of elements to be added should not exceed the maximum size of the stack. 4. the stack base remains fixed while the stack top changes as elements are added and removed. we will reach a stack underflow condition. “Pop” is the term used to delete an element from the stack. This is called as the size of the stack. Figure 4.1. at the end or in the middle. so the last element added to the stack will be the first element removed from the stack. The most accessible element is the top and the least accessible element is the bottom of the stack. first out) lists. the last item to be added to a stack is the first item to be removed.e.1. Representation of Stack: Let us consider a stack with 6 elements capacity. at the beginning.Chapter 4 Stack and Queue There are certain situations in computer science that one wants to restrict insertions and deletions so that they can take place only at the beginning or the end of the list. As the items can be added or removed only from the top i. you cannot remove elements beyond the base of the stack. When a stack is created. Stacks are sometimes known as LIFO (last in. Linear lists and arrays allow one to insert and delete elements at any place in the list i.

Quit "). Display").2 shows a stack initially with three elements and shows the deletion of elements using pop(). return ch. printf("\n 1.h> # include <conio. the operation is performed by pop(). of Information Technology . Pop ").4 4 4 3 3 3 2 2 1 11 0 TOP Empty Stack 22 11 0 Insert 11 3 TOP 33 2 TOP 1 TOP 4 22 1 11 0 Insert 22 2 1 0 Insert 33 Figure 4..1. Figure 4.h> # include <stdlib. printf("\n 2. int menu() { int ch."). printf("\n 3. &ch). "). using array: # include <stdio. Push operations on stack When an element is taken off from the stack.2. printf("\n … Stack operations using ARRAY. printf("\n 4.2.. printf("\n -----------**********-------------\n"). int top = 0. scanf("%d".1.h> # define MAX 6 int stack[MAX]. Push ").. Source code for stack operations. printf("\n Enter your choice: "). if(top == 0) { printf("\n\nStack empty. } void display() { int i. Lecture Notes 90 Dept. Pop operations on stack 4. TOP 33 22 11 Initial Stack 4 4 4 4 3 3 3 3 2 2 2 1 1 2 1 0 TOP 22 11 1 TOP 11 0 POP 0 TOP 0 POP POP Empty Stack Figure 4. clrscr().

. if(top == MAX) { printf("\n\nStack Overflow. return. } Lecture Notes 91 Dept. return. stack[i]). display(). do { ch = menu(). } getch(). printf("\n\nData Pushed into the stack"). for(i = 0. } void push() { int data. of Information Technology . void pop() { if(top == 0) { printf("\n\nStack Underflow. i < top. scanf("%d". top = top + 1. switch(ch) { case 1: case 2: case 3: case 4: push().. break. stack[--top]). } else printf("\n\npopped element is: %d ". i++) printf("\t%d"."). stack[top] = data. } else { printf("\n\nEnter data: "). break. pop().} else { } } return."). break. printf("\n\nElements in stack:"). &data). } } void main() { int ch. } while(1). exit(0).

Linked stack representation 4. return temp. Linked List Implementation of Stack: We can represent a stack as a linked list. }. return.h> # include <conio.3. struct stack *next.1. node *top = NULL.h> # include <stdlib. &temp -> data). top 400 data next 40 X 400 30 400 300 20 start 100 300 200 10 200 100 Figure 4. The linked stack looks as shown in figure 4. using linked list: # include <stdio. } void push(node *newnode) { node *temp. of Information Technology .4. scanf("%d". void pop().1. node *start=NULL. } Lecture Notes 92 Dept. temp=(node *) malloc( sizeof(node)) . void display(). typedef struct stack node."). node* getnode() { node *temp. In a stack push and pop operations are performed at one end called top..h> struct stack { int data. Source code for stack operations. if( newnode == NULL ) { printf("\n Stack Overflow.3. printf("\n Enter data "). We can perform similar operations at one end of list using top pointer.4. temp -> next = NULL.3. void push().

if(top == NULL) { printf("\n\n\t\t Stack is empty "). top = newnode. } printf("\n\n\t Data pushed into stack"). if( start -> next == NULL) { printf("\n\n\t Popped element is %d ". top = temp. printf("%5d ". } else { while(temp -> next != top) { temp = temp -> next. } temp = start. temp -> data). free(top). } else { temp = start. printf("\n\n\n\t\t Elements in the stack: \n"). top = NULL. return. } void pop() { node *temp. } } } Lecture Notes 93 Dept. top = newnode. printf("\n\n\t Popped element is %d ". free(top). while( temp -> next != NULL) temp = temp -> next. temp -> data). top -> data). } temp -> next = NULL. top -> data). temp -> next = newnode. if(top == NULL) { printf("\n\n\t Stack underflow"). start = NULL. } else { temp = start. } } void display() { node *temp. printf("%5d ".if(start == NULL) { start = newnode. of Information Technology . while(temp != top) { temp = temp -> next.

printf("\n 4. break. Algebraic Expressions: An algebraic expression is a legal combination of operators and operands. z or a constant like 5. case '4': return. An algebraic expression can be represented using three different notations. Operator is a symbol which signifies a mathematical or logical operation between the operands. -. do { ch = menu(). Example: (A + B) * (C . Examples of familiar operators include +. node *newnode. } 4. case '2' : pop().char menu() { char ch. 4. Display"). printf("\n \tStack operations using pointers. printf("\n -----------**********-------------\n"). push(newnode). /. printf("\n 1. break. } while( ch != '4' ). of Information Technology .D) Prefix: It is the form of an arithmetic notation in which we fix (place) the arithmetic operator before (pre) its two operands. 6 etc. Quit "). "). They are infix. y. *. Push "). return ch. printf("\n 2. printf("\n 3. ch = getche(). case '3' : display(). switch(ch) { case '1' : newnode = getnode(). postfix and prefix notations: Infix: It is the form of an arithmetic expression in which we fix (place) the arithmetic operator in between the two operands. Operand may be a variable like x. } void main() { char ch. printf("\n Enter your choice: "). } getch().. clrscr(). Pop ").2. break. ^ etc. The prefix notation is called as Lecture Notes 94 Dept. Operand is the quantity on which a mathematical operation is performed.

/ and \$ or ↑ (exponentiation). While evaluating the postfix expression the priority of the operators is no longer relevant. 3. 2. -. then place directly in the postfix expression (output). Infix to postfix Infix to prefix Postfix to infix Postfix to prefix Prefix to infix Prefix to postfix 4. / Next highest 2 +. For these binary operations. 6. b) If the scanned symbol is an operand. Scan the infix expression from left to right. The parentheses ambiguously. Example: * + A B – C D Postfix: It is the form of an arithmetic expression in which we fix (place) the arithmetic operator after (post) its two operands. a) If the scanned symbol is left parenthesis. Lecture Notes 95 Dept.polish notation (due to the polish mathematician Jan Lukasiewicz in the year 1920). push it onto the stack. 4. The operands maintain the same order as in the equivalent infix expression.* The three important features of postfix expression are: 1. We consider five binary operations: +. are not needed to designate the expression un- 3. Converting expressions using Stack: Let us convert the expressions from one type to another. These can be done as follows: 1. Conversion from infix to postfix: Procedure to convert from infix expression to postfix expression is as follows: 1. The postfix notation is called as suffix notation and is also referred to reverse polish notation.3. *. 5. 2.1. - Lowest 1 Exponentiation (\$ or ↑ or ^) 4. 2.3. the following in the order of precedence (highest to lowest): OPERATOR PRECEDENCE VALUE Highest 3 *. Example: A B + C D . of Information Technology .

then go on removing all the operators from the stack and place them in the postfix expression. Pop the output symbols from the stack until it is empty. then go on popping all the items from the stack and place them in the postfix expression till we get the matching left parenthesis. of Information Technology . Example 1: Convert ((A – (B + C)) * D) ↑ (E + F) infix expression to postfix form: SYMBOL POSTFIX STRING STACK ( ( ( (( REMARKS A A (( - A ((- ( A ((-( B AB ((-( + AB ((-(+ C ABC ((-(+ ) ABC+ ((- ) ABC+- ( * ABC+- (* D ABC+-D (* ) ABC+-D* ↑ ABC+-D* ↑ ( ABC+-D* ↑( E ABC+-D*E ↑( + ABC+-D*E ↑(+ F ABC+-D*EF ↑(+ ) ABC+-D*EF+ ↑ ABC+-D*EF+↑ The input is now empty. d) If the scanned symbol is an operator. if and only if the precedence of the operator which is on the top of the stack is greater than (or greater than or equal) to the precedence of the scanned operator and push the scanned operator onto the stack otherwise. SYMBOL POSTFIX STRING a a + a + b ab + Lecture Notes STACK 96 REMARKS Dept. push the scanned operator onto the stack.c) If the symbol scanned is a right parenthesis. End of string Example 2: Convert a + b * c + (d * e + f) * g the infix expression into postfix form.

SYMBOL POSTFIX STRING STACK A A + A + B AB + * AB +* C ABC +* - ABC*+ - D ABC*+D - REMARKS / ABC*+D -/ E ABC*+DE -/ * ABC*+DE/ -* H End of string ABC*+DE/H -* The input is now empty. Pop the output symbols from the stack until it is empty. of Information Technology .* ab +* c abc +* + abc*+ + ( abc*+ +( d abc*+d +( * abc*+d +(* e abc*+de +(* + abc*+de* +(+ f abc*+de*f +(+ ) abc*+de*f+ + * abc*+de*f+ +* g abc*+de*f+g +* End of string abc*+de*f+g*+ The input is now empty. Pop the output symbols from the stack until it is empty. ABC*+DE/H*- Example 4: Convert the following infix expression A + (B * C – (D / E ↑ F) * G) * H into its equivalent postfix expression. Example 3: Convert the following infix expression A + B * C – D / E * H into its equivalent postfix expression. SYMBOL POSTFIX STRING A A + A Lecture Notes STACK REMARKS + 97 Dept.

3. k ++) { if(op == operators[k]) pv1 = priority_value[k]. else return 0. if( op_at_stack == '(' ) return 0. } if(pv1 < pv2) return 1. '(' }. top = 0. k < 6. char op_at_stack) { int k. } Lecture Notes 98 Dept. Pop the output symbols from the stack until it is empty.4}.2. /* priority value of op_at_stack */ char operators[] = {'+'. '-'. 4. } for(k = 0. int pv1. '%'. j. '*'. k ++) { if(op_at_stack == operators[k]) pv2 = priority_value[k]. k < 6. int priority_value[] = {0.1. /* priority value of op */ int pv2. of Information Technology . char infix[50].( A +( B AB +( * AB +(* C ABC +(* - ABC* +(- ( ABC* +(-( D ABC*D +(-( / ABC*D +(-(/ E ABC*DE +(-(/ ↑ ABC*DE +(-(/↑ F ABC*DEF +(-(/↑ ) ABC*DEF↑/ +(- * ABC*DEF↑/ +(-* G ABC*DEF↑/G +(-* ) ABC*DEF↑/G*- + * ABC*DEF↑/G*- +* H ABC*DEF↑/G*-H +* End of string ABC*DEF↑/G*-H*+ The input is now empty.h> char postfix[50].3.2. /* operator stack */ int lesspriority(char op. Program to convert an infix to postfix expression: # include <string. '^'. char opstack[50]. '/'.0.1. int i. for(k = 0.

clrscr(). break. j++. j++. } } while(top >= 0) { postfix[j] = opstack[--top]. /* pushing onto stack */ top++. printf("\n Enter Infix Expression : "). j++. Lecture Notes /* check priority and push */ 99 Dept.operator */ { if(top == 0) /* before pushing the operator { 'op' into the stack check priority opstack[top] = op. } } pop() { while(opstack[--top] != '(' ) { postfix[j] = opstack[top]. of op with top of opstack if less top++. case '(' : case '+' : case '-' : case '*' : case '/' : case '^' : case '%' : push(ch). gets(infix). of Information Technology . then pop the operator from stack } then push into postfix string else else push op onto stack itself */ { if(op != '(' ) { while(lesspriority(op. break. } } opstack[top] = op. opstack[top-1]) == 1 && top > 0) { postfix[j] = opstack[--top]. j++. default : postfix[j] = ch. while( (ch=infix[i++]) != ‘\0’) { switch(ch) { case ' ' : break.void push(char op) /* op . } /* pop until '(' comes */ } void main() { char ch. case ')' : pop().

SYMBOL PREFIX STRING STACK ) REMARKS ) D D ) - D )- C CD )- ( -CD * -CD * ) -CD *) B B-CD *) + B-CD *)+ A AB-CD *)+ ( +AB–CD * End of string Lecture Notes *+AB–CD The input is now empty. Conversion from infix to prefix: The precedence rules for converting an expression from infix to prefix are identical. postfix).3. 100 Dept. The prefix form of a complex expression is not the mirror image of the postfix form. printf("\n Postfix Expression : %s ". The only change from postfix conversion is that traverse the expression from right to left and the operator is placed before the operands rather than after them. Example 2: Convert the infix expression (A + B) * (C . printf("\n Infix Expression : %s ". getch(). SYMBOL PREFIX STRING STACK C C - C - B BC - + BC -+ A ABC -+ End of string -+ABC REMARKS The input is now empty. Pop the output symbols from the stack until it is empty.3. Example 1: Convert the infix expression A + B . } 4.} postfix[j] = '\0'. Pop the output symbols from the stack until it is empty. infix).D) into prefix expression.C into prefix expression. of Information Technology .

h> # include <string. char infix[50]. if(j == 0) prefix[0] = ch. } Lecture Notes 101 Dept.1]. top = 0. of Information Technology .Example 3: Convert the infix expression A ↑ B * C – D + E / F / (G + H) into prefix expression. Program to convert an infix to prefix expression: # include <conio. REMARKS +-*↑ABCD//EF+GH The input is now empty. int j. /* operator stack */ void insert_beg(char ch) { int k. else { for(k = j + 1.h> char prefix[50]. } j++.4.3. k--) prefix[k] = prefix[k . SYMBOL PREFIX STRING STACK ) ) H H ) + H )+ G GH )+ ( +GH / +GH / F F+GH / / F+GH // E EF+GH // + //EF+GH + D D//EF+GH + - D//EF+GH +- C CD//EF+GH +- * CD//EF+GH +-* B BCD//EF+GH +-* ↑ BCD//EF+GH +-*↑ A ABCD//EF+GH +-*↑ End of string 4. Pop the output symbols from the stack until it is empty. k > 0. prefix[0] = ch. char opstack[50].

top++. 1. 0. /* priority value of op */ int pv2. clrscr(). else return 0. k < 6. } */ /* pop until ')' comes. Lecture Notes 102 Dept. */ void main() { char ch. } for(k = 0. 2. '/'. if(op_at_stack == ')' ) return 0. '*'. /* priority value of op_at_stack */ char operators[] = {'+'. } if(pv1 < pv2) return 1. int priority_value[] = {0. k < 6. k ++) { if( op_at_stack == operators[k] ) pv2 = priority_value[k]. opstack[top-1]) == 1 && top > 0) { insert_beg(opstack[--top]). '%'. '-'. } void push(char op) /* op – operator */ { if(top == 0) { opstack[top] = op. ')'}. 1. of Information Technology . char op_at_stack) { int k. int l. k ++) { if(op == operators[k]) pv1 = priority_value[k]. } } } } opstack[top] = op. for(k = 0. } else { if(op != ')') { /* before pushing the operator 'op' into the stack check priority of op with top of operator stack if less pop the operator from stack then push into postfix string else push op onto stack itself */ while(lesspriority(op. /* pushing onto stack void pop() { while(opstack[--top] != ')') insert_beg(opstack[top]). i = 0.int lesspriority(char op. int pv1. printf("\n Enter Infix Expression : "). top++. '^'. 3. 4}.

Example: Convert the following postfix expression A B C * D E F ^ / G * . /* check priority and push */ Conversion from postfix to infix: Procedure to convert postfix expression to infix expression is as follows: 1.5. l = strlen(infix). Repeat steps 2 and 3 till the end of the expression. switch(ch) { case ' ' : break. of Information Technology .3. then push it onto the stack. printf("\n Infix Expression : %s ". 4. while(l > 0) { ch = infix[--l]. If the scanned symbol is an operand. 4. Lecture Notes 103 Dept. If the scanned symbol is an operator. printf("\n Prefix Expression : %s ".} gets(infix).H * + into its equivalent infix expression. case '(' : pop(). infix). 3. pop two symbols from the stack and create it as a string by placing the operator in between the operands and push it onto the stack. j++. prefix). Scan the postfix expression from left to right. case ')' : case '+' : case '-' : case '*' : case '/' : case '^' : case '%' : push(ch). getch(). } } while( top > 0 ) { insert_beg( opstack[--top] ). } prefix[j] = '\0'. 2. break. default : insert_beg(ch). break.

Symbol

Stack

Remarks

A

A

B

A

B

C

A

B

*

A

(B*C)

D

A

(B*C)

D

E

A

(B*C)

D

E

F

A

(B*C)

D

E

^

A

(B*C)

D

(E^F)

/

A

(B*C)

(D/(E^F))

G

A

(B*C)

(D/(E^F))

*

A

(B*C)

((D/(E^F))*G)

-

A

((B*C) – ((D/(E^F))*G))

H

A

((B*C) – ((D/(E^F))*G))

*

A

(((B*C) – ((D/(E^F))*G)) * H)

+

(A + (((B*C) – ((D/(E^F))*G)) * H))

End of
string

Push B
C

Push C
Pop two operands and place the
operator in between the operands and
push the string.
Push D
Push E
F

Push F
Pop two operands and place the
operator in between the operands and
push the string.
Pop two operands and place the
operator in between the operands and
push the string.
G

Push G
Pop two operands and place the
operator in between the operands and
push the string.
Pop two operands and place the
operator in between the operands and
push the string.
H

Push H
Pop two operands and place the
operator in between the operands and
push the string.

The input is now empty. The string formed is infix.

4.3.6.
#
#
#
#

Push A

Program to convert postfix to infix expression:

include <stdio.h>
include <conio.h>
include <string.h>
define MAX 100

void pop (char*);
void push(char*);
char stack[MAX] [MAX];
int top = -1;

Lecture Notes

104

Dept. of Information Technology

void main()
{
char s[MAX], str1[MAX], str2[MAX], str[MAX];
char s1[2],temp[2];
int i=0;
clrscr( ) ;
printf("\Enter the postfix expression; ");
gets(s);
while (s[i]!='\0')
{
if(s[i] == ' ' )
/*skip whitespace, if any*/
i++;
if (s[i] == '^' || s[i] == '*'|| s[i] == '-' || s[i] == '+' || s[i] == '/')
{
pop(str1);
pop(str2);
temp[0] ='(';
temp[1] ='\0';
strcpy(str, temp);
strcat(str, str2);
temp[0] = s[i];
temp[1] = '\0';
strcat(str,temp);
strcat(str, str1);
temp[0] =')';
temp[1] ='\0';
strcat(str,temp);
push(str);
}
else
{
temp[0]=s[i];
temp[1]='\0';
strcpy(s1, temp);
push(s1);
}
i++;
}
printf("\nThe Infix expression is: %s", stack[0]);
}
void pop(char *a1)
{
strcpy(a1,stack[top]);
top--;
}
void push (char*str)
{
if(top == MAX - 1)
printf("\nstack is full");
else
{
top++;
strcpy(stack[top], str);
}
}

Lecture Notes

105

Dept. of Information Technology

4.3.7.

Conversion from postfix to prefix:

Procedure to convert postfix expression to prefix expression is as follows:
1.

Scan the postfix expression from left to right.

2.

If the scanned symbol is an operand, then push it onto the stack.

3.

If the scanned symbol is an operator, pop two symbols from the stack
and create it as a string by placing the operator in front of the operands
and push it onto the stack.

5.

Repeat steps 2 and 3 till the end of the expression.

Example:
Convert the following postfix expression A B C * D E F ^ / G * - H * + into its
equivalent prefix expression.
Symbol

Stack

A

A

B

A

B

C

A

B

*

A

*BC

D

A

*BC

D

E

A

*BC

D

E

F

A

*BC

D

E

^

A

*BC

D

/

A

*BC

/D^EF

G

A

*BC

/D^EF

*

A

*BC

*/D^EFG

-

A

- *BC*/D^EFG

H

A

- *BC*/D^EFG

*

A

*- *BC*/D^EFGH

+

+A*-*BC*/D^EFGH

End of
string

Remarks
Push A
Push B

C

Push C
Pop two operands and place the operator in
front the operands and push the string.
Push D
Push E
F

Push F
Pop two operands and place the operator in
front the operands and push the string.

^EF

Pop two operands and place the operator in
front the operands and push the string.
G

Push G
Pop two operands and place the operator in
front the operands and push the string.
Pop two operands and place the operator in
front the operands and push the string.
H

Push H
Pop two operands and place the operator in
front the operands and push the string.

The input is now empty. The string formed is prefix.

Lecture Notes

106

Dept. of Information Technology

4.3.8.

Program to convert postfix to prefix expression:

# include <conio.h>
# include <string.h>
#define MAX 100
void pop (char *a1);
void push(char *str);
char stack[MAX][MAX];
int top =-1;
main()
{

}

char s[MAX], str1[MAX], str2[MAX], str[MAX];
char s1[2], temp[2];
int i = 0;
clrscr();
printf("Enter the postfix expression; ");
gets (s);
while(s[i]!='\0')
{
/*skip whitespace, if any */
if (s[i] == ' ')
i++;
if(s[i] == '^' || s[i] == '*' || s[i] == '-' || s[i]== '+' || s[i] == '/')
{
pop (str1);
pop (str2);
temp[0] = s[i];
temp[1] = '\0';
strcpy (str, temp);
strcat(str, str2);
strcat(str, str1);
push(str);
}
else
{
temp[0] = s[i];
temp[1] = '\0';
strcpy (s1, temp);
push (s1);
}
i++;
}
printf("\n The prefix expression is: %s", stack[0]);

void pop(char*a1)
{
if(top == -1)
{
printf("\nStack is empty");
return ;
}
else
{
strcpy (a1, stack[top]);
top--;
}
}

Lecture Notes

107

Dept. of Information Technology

Repeat steps 2 and 3 till the end of the expression. strcpy(stack[top].void push (char *str) { if(top == MAX .1) printf("\nstack is full"). D Push D Pop two operands and place the operator in between the operands and push the string. If the scanned symbol is an operator. Example: Convert the following prefix expression + A * . Pop two operands and place the operator in between the operands and push the string. 2. then push it onto the stack. Push C B Push B Pop two operands and place the operator in front the operands and push the string. Pop two operands and place the operator in front the operands and push the 108 Dept. Symbol Stack Remarks H H G H G F H G F E H G F ^ H G (E^F) D H G (E^F) / H G (D/(E^F)) * H ((D/(E^F))*G) C H ((D/(E^F))*G) C B H ((D/(E^F))*G) C * H ((D/(E^F))*G) (B*C) - H ((B*C)-((D/(E^F))*G)) Lecture Notes Push H Push G Push F E Push E Pop two operands and place the operator in between the operands and push the string. 4.3.9. else { top++. Scan the prefix expression from right to left (reverse order). } } 4. If the scanned symbol is an operand. Conversion from prefix to infix: Procedure to convert prefix expression to infix expression is as follows: 1. 3. str). pop two symbols from the stack and create it as a string by placing the operator in between the operands and push it onto the stack. of Information Technology .* B C * / D ^ E F G H into its equivalent infix expression.

strcpy(str. temp[1]='\0'. Pop two operands and place the operator in front the operands and push the string. } else { temp[0]=s[i]. void main() { char s[MAX]. pop(str2). The input is now empty. printf("\Enter the prefix expression. str1[MAX]. void push(char*). temp). 4.temp). clrscr( ) . while (s[i]!='\0') { /*skip whitespace. temp[0] ='('. of Information Technology .string. temp[0] = s[i]. str2). if any*/ if(s[i] == ' ' ) i++. strcat(str.temp[2].3. temp[1] = '\0'. Program to convert prefix to infix expression: # include <string. "). strrev(s).10. * (((B*C)-((D/(E^F))*G))*H) A (((B*C)-((D/(E^F))*G))*H) + (A+(((B*C)-((D/(E^F))*G))*H)) End of string A Push A Pop two operands and place the operator in front the operands and push the string. temp[1] ='\0'. push(str).h> # define MAX 100 void pop (char*). temp[0] =')'. int i=0. char stack[MAX] [MAX]. if (s[i] == '^' || s[i] == '*'|| s[i] == '-' || s[i] == '+' || s[i] == '/') { pop(str1). temp[1] ='\0'. push(s1). gets(s). The string formed is infix. str[MAX].temp). strcat(str. str1). str2[MAX]. strcat(str. strcat(str. strcpy(s1. int top = -1. temp). char s1[2]. Lecture Notes 109 Dept.

Repeat steps 2 and 3 till the end of the expression.3. top--.1) printf("\nstack is full"). If the scanned symbol is an operator. 4.stack[top]).} i++. } } printf("\nThe infix expression is: %s". Example: Convert the following prefix expression + A * . str).11. strcpy(stack[top]. } void push (char*str) { if(top == MAX . pop two symbols from the stack and create it as a string by placing the operator after the operands and push it onto the stack. 2.* B C * / D ^ E F G H into its equivalent postfix expression. Scan the prefix expression from right to left (reverse order). Conversion from prefix to postfix: Procedure to convert prefix expression to postfix expression is as follows: 1. void pop(char *a1) { strcpy(a1. } } 4. D Push D 110 Dept. else { top++. Symbol Stack H H G H G F H G F E H G F ^ H G EF^ D H G EF^ Lecture Notes Remarks Push H Push G Push F E Push E Pop two operands and place the operator after the operands and push the string. then push it onto the stack. stack[0]). If the scanned symbol is an operand. of Information Technology . 3.

int i = 0. Program to convert prefix to postfix expression: # include <stdio. strrev(s). temp[2]. if(s[i] == '^' || s[i] == '*' || s[i] == '-' || s[i]== '+' || s[i] == '/') { pop (str1).h> # include <string. int top =-1.h> #define MAX 100 void pop (char *a1). temp[1] = '\0'. 4. void push(char *str). temp). if any */ i++. str1[MAX].12. strcat(str1. Pop two operands and place the operator after the operands and push the string. Push C B Push B Pop two operands and place the operator after the operands and push the string. while(s[i]!='\0') { if (s[i] == ' ') /*skip whitespace. char stack[MAX][MAX].h> # include <conio. gets (s). of Information Technology . Pop two operands and place the operator after the operands and push the string. void main() { char s[MAX]. "). char s1[2]. push(str). strcat (str1.Pop two operands and place the operator after the operands and push the string. temp[0] = s[i]. A Push A Pop two operands and place the operator after the operands and push the string. / H G * H DEF^/G* C H DEF^/G* C B H DEF^/G* C * H DEF^/G* BC* - H BC*DEF^/G*- * BC*DEF^/G*-H* A BC*DEF^/G*-H* + ABC*DEF^/G*-H*+ End of string DEF^/ Pop two operands and place the operator after the operands and push the string. str2[MAX].3. The string formed is postfix. The input is now empty. clrscr(). } Lecture Notes 111 Dept.str2). printf("Enter the prefix expression. pop (str2). strcpy(str. str1). str[MAX].

else { temp[0] = s[i]. else { top++. } else { strcpy (a1. 5. 5. Example 1: Evaluate the postfix expression: 6 5 2 3 + 8 * + 3 + * SYMBOL OPERAND 1 OPERAND 2 VALUE STACK 6 6 5 6. } } 4. temp[1] = '\0'. 5 112 REMARKS The first four symbols are placed on the stack. When an expression is given in postfix notation. When a number is seen. top--. return . 2 3 6. str). it is pushed onto the stack. this is our obvious advantage. temp). } void pop(char*a1) { if(top == -1) { printf("\nStack is empty"). } printf("\nThe postfix expression is: %s". 3 + Lecture Notes 2 3 5 6. Next a ‘+’ is read. 5 2 6. push (s1).1) printf("\nstack is full"). Evaluation of postfix expression: The postfix expression is evaluated easily by the use of a stack. strcpy(stack[top]. stack[top]). 2. 5. when an operator is seen. } i++. there is no need to know any precedence rules. stack[0]). the operator is applied to the two numbers that are popped from the stack and the result is pushed onto the stack. strcpy (s1. } } void push (char *str) { if(top == MAX . is pushed Dept. of Information Technology .4. so 3 and 2 are popped from the stack and their sum 5.

4. else return 0. 3 + 2 3 5 6. of Information Technology . 48 * 6 48 288 288 Next 8 is pushed Now a ‘*’ is seen. 5 - 6 5 1 1 3 6 5 1 1. ‘+’ pops 3 and 45 and pushes 45 + 3 = 48 is pushed Finally. 2 3 6. 5. 3. a ‘+’ is seen. a ‘*’ is seen and 48 and 6 are popped. OPERAND 1 OPERAND 2 VALUE STACK 6 6 2 6. 2. 3. 40 + 5 40 45 6. 3 + 49 3 52 52 Program to evaluate a postfix expression: # include <conio. 8. 7 * 1 7 7 7 2 1 7 7 7. 3 is pushed Next.8 2 3 5 6. 5. 3. } Lecture Notes 113 Dept. 4 + 3 4 7 1. 2 ↑ 7 2 49 49 3 7 2 49 49. 45 3 5 40 45 6. 5. 3 + 45 3 48 6. so 40 and 5 are popped and 40 + 5 = 45 is pushed Now.3 8 2 / + * 2 ↑ 3 + SYMBOL 4. 2 / 8 2 4 1. 8 * 5 8 40 6. so 8 and 5 are popped as 8 * 5 = 40 is pushed Next. 3 8 6 5 1 1. 8 2 6 5 1 1. the result 6 * 48 = 288 is pushed Example 2: Evaluate the following postfix expression: 6 2 3 + .h> # define MAX 20 int isoperator(char ch) { if(ch == '+' || ch == '-' || ch == '*' || ch == '/' || ch == '^') return 1. 45.h> # include <math.1.

float val_stack[MAX]. val_stack[0] ). break. printf("\n Enter a postfix expression: "). switch(ch) { case '+': res = val1 + val2. while((ch = postfix[i]) != '\0') { if(isoperator(ch) == 1) { val2 = val_stack[--top].void main(void) { char postfix[MAX].5. i++. break. Lecture Notes 114 Dept. of Information Technology . case '*': res = val1 * val2. case '/': res = val1 / val2. break. val1 = val_stack[--top]. In recursion. 5. } printf("\n Values of %s is : %f ".postfix. int i = 0. } 4. clrscr(). postfix). During a function call the return address and arguments are pushed onto a stack and on return they are popped off. scanf("%s". Applications of stacks: 1. res. Stack is used by compilers to check for balancing of parentheses. 2. 4. val2. 3. brackets and braces. val1. getch(). all intermediate arguments and return values are stored on the processor’s stack. } val_stack[top] = res. break. Stack is used to evaluate a postfix expression. case '-': res = val1 . char ch. } else val_stack[top] = ch-48. case '^': res = pow(val1. Stack is used to convert an infix expression into postfix/prefix form. val2). top = 0. /*convert character digit to integer digit */ top++. int val.val2. break.

4.6.

Queue:

A queue is another special kind of list, where items are inserted at one end called the
rear and deleted at the other end called the front. Another name for a queue is a
“FIFO” or “First-in-first-out” list.
The operations for a queue are analogues to those for a stack, the difference is that the
insertions go at the end of the list, rather than the beginning. We shall use the
following operations on queues:

enqueue: which inserts an element at the end of the queue.

dequeue: which deletes an element at the start of the queue.

4.6.1.

Representation of Queue:

Let us consider a queue, which can hold maximum of five elements. Initially the queue
is empty.
0

1

2

3

4
Q u e u e E mp t y
F RO NT = RE A R = 0

F R

Now, insert 11 to the queue. Then queue status will be:
0

1

2

3

4
RE A R = RE A R + 1 = 1
F RO NT = 0

11

F

R

Next, insert 22 to the queue. Then the queue status is:
0

1

11

22

F

2

3

4
RE A R = RE A R + 1 = 2
F RO NT = 0

R

Again insert another element 33 to the queue. The status of the queue is:
0

1

2

11

22

33

F

Lecture Notes

3

4
RE A R = RE A R + 1 = 3
F RO NT = 0

R

115

Dept. of Information Technology

Now, delete an element. The element deleted is the element at the front of the queue.
So the status of the queue is:
0

1

2

22

33

F

3

4
RE A R = 3
F RO NT = F R O NT + 1 = 1

R

Again, delete an element. The element to be deleted is always pointed to by the FRONT
pointer. So, 22 is deleted. The queue status is as follows:
0

1

2

3

4
RE A R = 3
F RO NT = F R O NT + 1 = 2

33

F

R

Now, insert new elements 44 and 55 into the queue. The queue status is:
0

1

2
33

3

4

44

55

F

RE A R = 5
F RO NT = 2

R

Next insert another element, say 66 to the queue. We cannot insert 66 to the queue as
the rear crossed the maximum size of the queue (i.e., 5). There will be queue full
signal. The queue status is as follows:
0

1

2
33

3

4

44

55

F

RE A R = 5
F RO NT = 2

R

Now it is not possible to insert an element 66 even though there are two vacant
positions in the linear queue. To over come this problem the elements of the queue are
to be shifted towards the beginning of the queue so that it creates vacant position at
the rear end. Then the FRONT and REAR are to be adjusted properly. The element 66
can be inserted at the rear end. After this operation, the queue status is as follows:
0

1

2

33

44

55

F

3

4
RE A R = 4
F RO NT = 0

66

R

This difficulty can overcome if we treat queue position with index 0 as a position that
comes after position with index 4 i.e., we treat the queue as a circular queue.

Lecture Notes

116

Dept. of Information Technology

4.6.2.

Source code for Queue operations using array:

In order to create a queue we require a one dimensional array Q(1:n) and two
variables front and rear. The conventions we shall adopt for these two variables are
that front is always 1 less than the actual front of the queue and rear always points to
the last element in the queue. Thus, front = rear if and only if there are no elements in
the queue. The initial condition then is front = rear = 0. The various queue operations
to perform creation, deletion and display the elements in a queue are as follows:
1.

insertQ(): inserts an element at the end of queue Q.

2.

deleteQ(): deletes the first element of Q.

3.

displayQ(): displays the elements in the queue.

# include <conio.h>
# define MAX 6
int Q[MAX];
int front, rear;
void insertQ()
{
int data;
if(rear == MAX)
{
printf("\n Linear Queue is full");
return;
}
else
{
printf("\n Enter data: ");
scanf("%d", &data);
Q[rear] = data;
rear++;
printf("\n Data Inserted in the Queue ");
}
}
void deleteQ()
{
if(rear == front)
{
printf("\n\n Queue is Empty..");
return;
}
else
{
printf("\n Deleted element from Queue is %d", Q[front]);
front++;
}
}
void displayQ()
{
int i;
if(front == rear)
{
printf("\n\n\t Queue is Empty");
return;
}
else
{
printf("\n Elements in Queue are: ");
for(i = front; i < rear; i++)

Lecture Notes

117

Dept. of Information Technology

{

printf("%d\t", Q[i]);

}

}
}
{
int ch;
clrscr();
printf("\n \tQueue operations using ARRAY..");
printf("\n -----------**********-------------\n");
printf("\n 1. Insert ");
printf("\n 2. Delete ");
printf("\n 3. Display");
printf("\n 4. Quit ");
scanf("%d", &ch);
return ch;
}
void main()
{
int ch;
do
{
switch(ch)
{
case 1:
insertQ();
break;
case 2:
deleteQ();
break;
case 3:
displayQ();
break;
case 4:
return;
}
getch();
} while(1);
}

4.6.3.

We can represent a queue as a linked list. In a queue data is deleted from the front end
and inserted at the rear end. We can perform similar operations on the two ends of a
list. We use two pointers front and rear for our linked queue implementation.
The linked queue looks as shown in figure 4.4:
front

rear

100

400

10
100

200

20

300

200

30

400

300

40

X

400

Lecture Notes

118

Dept. of Information Technology

temp -> next = NULL. newnode = getnode(). printf("\n Enter data "). Source code for queue operations using linked list: # include <stdlib. if(newnode == NULL) { printf("\n Queue Full"). } if(front == NULL) { front = newnode."). free(temp).6. return. } void insertQ() { node *newnode.4. } else { rear -> next = newnode.h> # include <conio. node *front = NULL. typedef struct queue node. of Information Technology . rear = newnode.4. if(front == NULL) { printf("\n\n\t Empty Queue. }. scanf("%d". return temp. temp -> data). } void deleteQ() { node *temp. node *rear = NULL. front = front -> next.."). temp = (node *) malloc(sizeof(node)) .h> struct queue { int data. &temp -> data). printf("\n\n\t Deleted element from queue is %d ". node* getnode() { node *temp. rear = newnode. } Lecture Notes 119 Dept.. } printf("\n\n\t Data Inserted into the Queue. struct queue *next. return. } temp = front.

void displayQ()
{
node *temp;
if(front == NULL)
{
printf("\n\n\t\t Empty Queue ");
}
else
{
temp = front;
printf("\n\n\n\t\t Elements in the Queue are: ");
while(temp != NULL )
{
printf("%5d ", temp -> data);
temp = temp -> next;
}
}
}
{
char ch;
clrscr();
printf("\n \t..Queue operations using pointers.. ");
printf("\n\t -----------**********-------------\n");
printf("\n 1. Insert ");
printf("\n 2. Delete ");
printf("\n 3. Display");
printf("\n 4. Quit ");
ch = getche();
return ch;
}
void main()
{
char ch;
do
{
switch(ch)
{
case '1' :
insertQ();
break;
case '2' :
deleteQ();
break;
case '3' :
displayQ();
break;
case '4':
return;
}
getch();
} while(ch != '4');
}

Lecture Notes

120

Dept. of Information Technology

4.7.

Applications of Queue:

1.

It is used to schedule the jobs to be processed by the CPU.

2.

When multiple users send print jobs to a printer, each printing job is kept in
the printing queue. Then the printer prints those jobs according to first in
first out (FIFO) basis.

3.

Breadth first search uses a queue data structure to find an element from a
graph.

4.8.

Circular Queue:

A more efficient queue representation is obtained by regarding the array Q[MAX] as
circular. Any number of items could be placed on the queue. This implementation of a
queue is called a circular queue because it uses its storage array as if it were a circle
There are two problems associated with linear queue. They are:

Time consuming: linear time to be spent in shifting the elements to the
beginning of the queue.

Signaling queue full: even if the queue is having vacant position.

For example, let us consider a linear queue status as follows:
0

1

2
33

3

4

44

55

F

RE A R = 5
F RO NT = 2

R

Next insert another element, say 66 to the queue. We cannot insert 66 to the queue as
the rear crossed the maximum size of the queue (i.e., 5). There will be queue full
signal. The queue status is as follows:
0

1

2
33

F

3

4

44

55

RE A R = 5
F RO NT = 2

R

This difficulty can be overcome if we treat queue position with index zero as a position
that comes after position with index four then we treat the queue as a circular queue.
In circular queue if we reach the end for inserting elements to it, it is possible to insert
new elements if the slots at the beginning of the circular queue are empty.

Lecture Notes

121

Dept. of Information Technology

4.8.1.

Representation of Circular Queue:

Let us consider a circular queue, which can hold maximum (MAX) of six elements.
Initially the queue is empty.
F

R
0

5

Queue
MAX =
F RO NT
C O U NT

1

4

E mp t y
6
= RE A R = 0
= 0

2

3

C irc u l ar Q u e u e

Now, insert 11 to the circular queue. Then circular queue status will be:
F
0

5

R

11

F RO NT = 0
RE A R = ( RE A R + 1) % 6 = 1
C O U NT = 1

1

4

2

3

C irc u l ar Q u e u e

Insert new elements 22, 33, 44 and 55 into the circular queue. The circular queue
status is:
F
R
0

5
11

4

22

55

44

1

FRONT = 0
REAR = (REAR + 1) % 6 = 5
COUNT = 5

33

3

2

Circular Queue

Lecture Notes

122

Dept. of Information Technology

Now, delete an element. The element deleted is the element at the front of the circular
queue. So, 11 is deleted. The circular queue status is as follows:
R
0

5

F

4

22

55

44

F RO NT = (F R O NT + 1) % 6 = 1
RE A R = 5
C O U NT = C O U NT - 1 = 4

1

33
2

3

C irc u l ar Q u e u e

Again, delete an element. The element to be deleted is always pointed to by the FRONT
pointer. So, 22 is deleted. The circular queue status is as follows:
R
0

5

4

F RO NT = (F R O NT + 1) % 6 = 2
RE A R = 5
C O U NT = C O U NT - 1 = 3

1

55

44

33
F

2

3

C irc u l ar Q u e u e

Again, insert another element 66 to the circular queue. The status of the circular queue
is:
R
0

5
66

4

1

55

44
3

F RO NT = 2
RE A R = ( RE A R + 1) % 6 = 0
C O U NT = C O U NT + 1 = 4

33
2

F

C irc u l ar Q u e u e

Lecture Notes

123

Dept. of Information Technology

the circular queue is full. insert new elements 77 and 88 into the circular queue. } } Lecture Notes 124 Dept.Now. count --.2.h> # define MAX 6 int int int int CQ[MAX]. if we insert an element to the circular queue. front = 0. RE A R = 2 RE A R = RE A R % 6 = 2 C O U NT = 6 33 2 R F C irc u l ar Q u e u e Now. if(count == MAX) { printf("\n Circular Queue is Full")."). } else { printf("\n Deleted element from Circular Queue is %d ". count = 0. of Information Technology . count ++. So. 4. scanf("%d".8. void insertCQ() { int data. CQ[front]). The circular queue status is: 0 5 66 4 77 88 55 44 3 1 F RO NT = 2. } } void deleteCQ() { if(count == 0) { printf("\n\nCircular Queue is Empty. printf("\n Data Inserted in the Circular Queue "). CQ[rear] = data.h> # include <conio. rear = (rear + 1) % MAX. rear = 0. } else { printf("\n Enter data: ").. front = (front + 1) % MAX. Source code for Circular Queue operations. using array: # include <stdio. &data). as COUNT = MAX we cannot add the element to circular queue.

} void main() { int ch. j. break. printf("\n -----------**********-------------\n"). if(count == 0) { printf("\n\n\t Circular Queue is Empty "). printf("\n 4. clrscr().void displayCQ() { int i. do { ch = menu(). switch(ch) { case 1: case 2: case 3: case 4: default: } } getch(). j = count. } while(1). i = (i + 1) % MAX. return ch. printf("\n \t Circular Queue Operations using ARRAY. printf("\n Invalid Choice "). of Information Technology . for(i = front. return. printf("\n 1. scanf("%d". CQ[i]). } } } int menu() { int ch. deleteCQ(). j != 0. Delete "). Display"). j--) { printf("%d\t". Lecture Notes insertCQ(). printf("\n Enter Your Choice: "). Insert "). } else { printf("\n Elements in Circular Queue are: "). printf("\n 3. Quit ").").. 125 Dept. printf("\n 2. break. displayCQ(). &ch). break.

In this section we examine an extension of the queue. The word deque is an acronym derived from double-ended queue. Lecture Notes 126 Dept. which provides a means to insert and remove items at both ends of the queue. This data structure is a deque. • enqueue_front: insert an element at front.6. A deque provides four operations.5. which allows deletions at one end but allows insertions at both ends of the list. Figure 4. Representation of a deque. They are: • Input restricted deque (IRD) • Output restricted deque (ORD) An Input restricted deque is a deque. which allows insertions at one end but allows deletions at both ends of the list. • dequeue_front: delete an element at front.6 shows the basic operations on a deque.9. 11 22 enqueue_front(33) 33 11 22 enqueue_rear(44) 33 11 22 44 dequeue_front(33) 55 11 22 enqueue_front(55) 11 22 dequeue_rear(44) 11 22 44 Figure 4. Figure 4. Basic operations on deque There are two variations of deque.5 shows the representation of a deque. Deque: In the preceding section we saw that a queue in which we insert items at one end and from which we remove items at the other end. Deletion 36 16 56 62 Insertion 19 Insertion Deletion front rear Figure 4.4. • dequeue_rear: delete element at rear. An output restricted deque is a deque. of Information Technology . • enqueue_rear: insert element at rear.

Consider the usual algorithm to convert an infix expression to a postfix expression. +. 2. 5. Draw the stack for the case where the 11th symbol is: A. +. 2. b) P2: 3. -. 2. What is a linear data structure? Give two examples of linear data structures. A minus sign: E. 4. 5. Priority Queue: A priority queue is a collection of elements such that each element has been assigned a priority and such that the order in which elements are deleted and processed comes from the following rules: 1. A right parenthesis: D. *. -. -. +. A division sign: Lecture Notes 127 Dept. and programs with the same priority form a standard queue.10. *. 4. two elements with same priority are processed which they were added to the queue. +. *. What is the difference between the logical representation of a data structure and the physical representation? 4. Exercises 1. A number: B. + c) P3 : 3. Evaluate the following postfix expressions: a) P1: 5. suppose that you read and process the 11th symbol of the input. Is it possible to have two designs for the same data structure that provide the same functionality but are implemented differently? 3. -. 1. 2. of Information Technology . 9. An element of higher priority is processed before any element of lower priority. which in turn can be used for sorting purpose called heap sort. /. 7. 6. An efficient implementation for the Priority Queue is to use heap. 2.4. 4. Suppose that you have read 10 input characters during a conversion and that the stack now contains these symbols: bottom + ( * Now. ↑. - 6. according to the order in A prototype of a priority queue is time sharing system: programs of high priority are processed first. 7. A left parenthesis: C. 2. Transform the following infix expressions to reverse polish notation: a) A ↑ B * C – D + E / F / (G + H) b) ((A + B) * C – (D – E)) ↑ (F + G) c) A – B / (C * D ↑ E) d) (a + b ↑ c ↑ d) * (e + f / d)) f) 3 – 6 * 7 + 2 / 4 * 5 – 8 g) (A – B) / ((D + E) * F) h) ((A + B) / D) ↑ ((E – F) * G) 5. 6. 1. ↑. 3.

Lecture Notes 128 Dept. In a circular queue represented by an array.7. of Information Technology . How can one convert a postfix expression to its prefix equivalent and vice-versa? 13. “pop” operations on the stack and “add”. “rear” and MAX-QUEUE-SIZE? Write a “C” function to delete the K-th element from the “front” of a circular queue. A double-ended queue (deque) is a linear list where additions and deletions can be performed at either end. Can a queue be represented by a circular linked list with only one pointer pointing to the tail of the queue? Write “C” functions for the “add” and “delete” operations on such a queue 16. how can one specify the number of elements in the queue in terms of “front”. “delete” functions on the queue. 12. 8. 15. Explain what modifications would be needed to make the parenthesis matching algorithm check expressions with different kinds of parentheses such as (). Write a “C” function to copy one stack to another assuming a) The stack is implemented using array.* 6 3 – 4 1 c) + + 2 6 + . Write a program using stack for parenthesis matching. Represent N queues in a single one-dimensional array. Write a “C” function for your algorithm. Convert the following infix expressions to prefix notation: a) ((A + 2) * (B + 4)) -1 b) Z – ((((X + 1) * 2) – 5) / Y) c) ((C * 2) + 1) / (A + B) d) ((A + B) * C – (D . b) The stack is implemented using linked list. Write functions for “add” and “delete” operations on the ith queue 18. Write an algorithm to construct a fully parenthesized infix expression from its postfix equivalent. [] and {}'s. Represent a stack and queue in a single one-dimensional array.13 2 4 9. 14.E)) ↑ (F + G) e) A – B / (C * D ↑ E) 10. Write a “C” function to test whether a string of opening and closing parenthesis is well formed or not. Write functions for “push”. Evaluate the following prefix expressions: a) + * 2 + / 14 2 5 1 b) . 17. 11. Represent a deque using an array to store the elements of the list and write the “C” functions for additions and deletions.

/ . Transform the following infix expression to prefix form: ((C * 2) + 1) / (A + B) A. A queue is a data structure in which all insertions and deletions are made respectively at: A.* E / [ D ] 7. 3 B. A B + 1 2 C * + / C./ * A B C D [ B ] 8./ D. none of the above [ B ] 11. Transform the following infix expression to postfix form: A . both A and B D. Y 5 2 1 X + * .+ D. Transform the following infix expression to postfix form: (A + B) * (C – D) / E A. Queue B. Both the ends B. front and rear B. A B C D * / D. 4 B. . A B * C + D / C. front and front D. / . Evaluate the following prefix expression: * .B / (C * D) A. rear and front C. of Information Technology . Last in first out list C. A B + C D . 8 C. all the above [ D ] 2./ E B. First in first out list [ B ] Lecture Notes C. none of the above 129 Dept. Queue is also known as: A. First in first out list D. none of the above [ A ] [ A ] 4. A stack is a data structure in which all insertions and deletions of entries are made at: A. all the above Stack is referred as: A. At any position [ A ] 5.+ 4 3 5 / + 2 4 3 [ A ] 3. A. A B C * C D / . Double Linked List C. In the middle D. A B * C D . One end C. Queue D. 8 C. / * + 1 2 C A B + B. rear and rear [ A ] 6. Stack C. none of the above [ C ] 10.D C * B A B. Linked List D. / * ./ C.+ X 1 2 5 Y B. 1 D. none of the above [ D ] 12. Last in first out list B. none of the above 9. both A and B B. Evaluate the following postfix expression: 1 4 18 6 / 3 + + 5 / + A. A B + C D * . Which among the following is a Dynamic data structure: A.Multiple Choice Questions 1. / + * C 2 1 + A B D.* + X 1 2 5 Y C. Which among the following is a linear data structure: A. Stack B. 2 D. Transform the following infix expression to prefix form: Z – ((((X + 1) * 2) – 5) / Y) A.

Suppose we have a circular array implementation of the queue class. D. B. D. The constructor would require linear time. 'B'. D. of Information Technology . data[1] C. stacks use only one. B. and then removed one at a time. in what order will they be removed? A. front C. In the circular array version of the queue class (with a fixed-sized array). After all other entries that are smaller than the new entry. C. Only rear_ptr changes. but queues do not. D. data[12] [ D ] 16. After all other entries that are greater than the new entry. If the characters 'D'. empty B. data[2] D. At the tail C. [ ] 20. To implement the queue with a linked list. In the linked list implementation of the queue class. Queues require dynamic memory. A. Neither changes C. [ ] 19. D. DCAB B. One difference between a queue and a stack is: A. DCBA [ D ] 15. Which of these pointers will change during an insertion into a NONEMPTY queue? A. Consider the implementation of the queue using a circular array. [ B ] 21. which operations require linear time for their worst-case behavior? A. At the head B. Only front_ptr changes. but stacks do not. The get_front function would require linear time.13. [ C ] 14. data[11] B. front C. Only front_ptr changes. [ A ] 18. queues use only one. [ B ] 17. None of these operations. where does the push member function place the new entry on the linked list? A. What goes wrong if we try to keep all the items at the front of a partially-filled array (so that data[0] is always the front). push D. The insert function would require linear time. Both change. Stacks use two ends of the structure. ABCD C. The is_empty function would require linear time. Where does the push member function place the new entry in the array? A. None of these. push D. The CAPACITY is 42. empty B. keeping track of a front pointer and a rear pointer. ABDC D. Stacks require dynamic memory. 'A' are placed in a queue (in that order). [ D ] Lecture Notes 130 Dept. Only rear_ptr changes. keeping track of a front pointer and a rear pointer. which operations require linear time for their worst-case behavior? A. To implement the queue with a linked list. 'C'. B. Both change. Which of these pointers will change during an insertion into an EMPTY queue? A. C. Neither changes C. B. with ten items in the queue stored at data[2] through data[11]. In the linked-list version of the queue class. Queues use two ends of the structure.

D. B. There is a first entry. 25 D. 2 D.* A. The operation for adding an entry to a stack is traditionally called: A. If the expression ((2 + 3) * 4 + 5 * (6 + 7) * 8) + 9 is evaluated with * having precedence over +. Something between -15 and -100 B. remove Which of the following stack operations could result in stack underflow? A. [ D ] 24. pop D. D. Keeping track of local variables at run time. The one which was inserted most recently. The operation for removing an entry from a stack is traditionally called: A. then the value obtained is same as the value of which of the following prefix expressions? A. Syntax analyzer for a compiler. The implementation gets to choose either one. and so on. 3 B. What is the meaning of this statement? A. Two or more of the above answers [ C ] [ A ] 26. B. + + * + 2 3 4 * * 5 + 6 7 8 9 C.22. append D. A collection of stacks can be sorted. C. Evaluate the following prefix expression: + * 2 + / 14 2 5 1 A. + * + + 2 3 4 + + 5 * 6 7 8 9 [ A ] 31. Which of the following applications may use a stack? A. pop B. 27. 50 C. a second entry. Something between 15 and 100 [ A ] 30. D. * + + + 2 3 4 * * 5 + 6 7 8 9 B. 4 [ D ] 29. What is the maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression? A. This can never happen (violates the precondition) [ B ] 23. push B. B. A parentheses balancing program. Something between 5 and 15 E. Something between 5 and -5 D. Suppose top is called on a priority queue that has exactly two entries with equal priority. Stack entries may be compared with the '<' operation.12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The one which was inserted first. The entries must be stored in a linked list. of Information Technology . What is the value of the postfix expression 6 3 2 4 + . C. 1 C. delete C. + * + + 2 3 4 * * 5 + 6 7 8 9 D. How is the return value of top selected? A. 15 [ B ] Lecture Notes 131 Dept. [ D ] 28. peek D. insert B. is_empty C. add C. Entries in a stack are "ordered". push [ D ] 25. Here is an infix expression: 4 + 3 * (6 * 3 . 40 B. C. All of the above. Something between -5 and -15 C.

32 Parenthesis are never needed prefix or postfix expression: A. Fully parenthesized infix expression B. Queue [ D Lecture Notes 132 ] Dept. Conversion of infix arithmetic expression to postfix expression uses: A. Circular Queue D. False D. Prefix expression C. Cannot be expected B. none of the above [ C ] 36. even though the current number of elements in it. Cannot be expected B. both A and B D. Stack C. None of the above [ A ] 35. Simple Queue C. is less than its size: A. circular queue D. True C. True C. of Information Technology . False D. linked list B. Stack B. None of the above [ A ] 33 A postfix expression is merely the reverse of the prefix expression: A. Which among the following types of expressions does not require precedence rules for evaluation: A. None of the above [ B ] 34 Which among the following data structure may give overflow error.

1 A Tree and a not a tree In a tree data structure.1.1 shows a tree and a non-tree. Each node can have at most one link coming into it. Ordered trees are by far the commonest form of tree data structure. A tree in which such distinctions are made is called an ordered tree. none is the "first child" or "last child". a a b d c e b f c d A Tree e Not a Tree Figure 5. stacks. and cycles may be present in the graph. Trees are recursive structures. queues and linked lists organize data in linear order. The node where the link originates is called the parent node. Trees represent a special case of more general structures known as graphs. In this chapter in particular. The figure 5. A data structure is said to be non linear if its elements form a hierarchical classification where.Chapter 5 Binary Trees A data structure is said to be linear if its elements form a sequence or a linear list. there is no restrictions on the number of links that can enter or leave a node. there is no distinction between the various children of a node i. which have no children. 5. and data structures built on them are called ordered tree data structures. The root node has no parent. Each child node is itself the root of a subtree.. we will explain special type of trees known as binary trees. data items appear at various levels.1. which are easy to maintain in the computer.e. In a graph. Previous linear data structures that we have studied like an array. Trees and Graphs are widely used non-linear data structures. At the bottom of the tree are leaf nodes. is at the top of the hierarchy. Lecture Notes 133 Dept. Tree and graph structures represents hierarchial relationship between individual data elements. TREES: A tree is hierarchical collection of nodes.1. The links leaving a node (any number of links are allowed) point to child nodes. known as the root. Graphs are nothing but trees with certain restrictions removed. One of the nodes. of Information Technology .

such that ni is the parent of ni + 1 for i = 1. Subtree Any node of a tree. binary trees are the most common types of trees and form the basis of many important data structures. Tree Terminology: Leaf node A node with no children is called a leaf (or external node). k . the path between A and I is A. Binary Tree Binary trees are easy to implement because they have a small.1. 2. A tree with no nodes is called as a null tree.2. . .1. then A is called an ancestor of B and B is called a descendent of A. A left child B H F E D left subtree C right child right subtree G I Figure 5. The length of a path is 1 less than the number of nodes on the path. Lecture Notes 134 Dept..2.1. In a binary tree. with all of its descendants is a subtree.2.2. For the tree shown in figure 5. B. A binary tree is shown in figure 5. of Information Technology . nk.2. Thus there is a path of length zero from a node to itself.5. Path A sequence of nodes n1. Siblings The children of the same parent are called siblings. Because of this characteristic. fixed number of child links. n2. .1. . BINARY TREE: In general..1. I. A binary tree is either empty or consists of a node called the root together with two binary trees called the left subtree and the right subtree. each node can have at most two children. . D. A node which is not a leaf is called an internal node.. Ancestor and Descendent If there is a path from node A to node B. For the tree shown in figure 5. F and G are the siblings of the parent node C and H and I are the siblings of the parent node D. tree nodes can have any number of children.

node ‘C’ in figure 5. Level 0 1 4 8 Level 1 3 2 5 6 Level 2 7 Level 3 9 Figure 5. If h = height of a binary tree. level by level. The term depth is also used to denote height of the tree. and a right child is assigned one more than twice the number assigned its parent. 3.1. If a binary tree contains m nodes at level l. The maximum number of nodes at any level is 2n. a left child is assigned twice the number assigned its parent. For instance.1 2. Lecture Notes 135 Dept. Level by level numbering of binary tree Properties of binary trees: Some of the important properties of a binary tree are as follows: 1.2. it contains at most 2m nodes at level l + 1.Level The level of the node refers to its distance from the root. of Information Technology . The total number of edges in a full binary tree with n node is n .2. Height The maximum level in a tree determines its height. Depth The depth of a node is the number of nodes along the path from the root to that node.1 has a depth of 1. then a. The height of the tree of Figure 5. 4. The height of a node in a tree is the length of a longest path from the node to a leaf.1 node F is at level 2 and node H is at level 3. The root of the tree has level O. see Figure 5. The nodes of a complete binary tree can be numbered so that the root is assigned the number 1. Maximum number of leaves = 2h b. in the binary tree of Figure 5. Since a binary tree can contain at most one node at level 0 (the root). For example. left to right.2. it can contain at most 2l node at level l. Assigning level numbers and Numbering of nodes for a binary tree: The nodes of a binary tree can be numbered in a natural way.2.2. For example.2. and the level of any other node in the tree is one more than the level of its parent. Maximum number of nodes = 2h + 1 .2.1 is 3.

3.3(d) illustrates the full binary tree containing 15 nodes and of height 3.3(a) is strictly binary. Lecture Notes 136 Dept. Full Binary tree: A full binary tree of height h has all its leaves at level h. and the leaf nodes have no children. total number of nodes ( tn) = ∑ 2 l = 2 h + 1 − 1 . A full binary tree of height h contains 2h leaves and. h Thus by induction. Figure 5. and the level h is filled from left to right.2.4 shows examples of complete and incomplete binary trees.2. 2h .2. Examples of binary trees Complete Binary tree: A binary tree with n nodes is said to be complete if it contains all the first n nodes of the above numbering scheme. Thus the tree of figure 5. A complete binary tree of height h looks like a full binary tree down to level h-1. A full binary tree of height h is a strictly binary tree all of whose leaves are at level h.Strictly Binary tree: If every non-leaf node in a binary tree has nonempty left and right subtrees. Alternatively.2. All non leaf nodes of a full binary tree have two children. the tree is termed as strictly binary tree. 1 1 Strict Binary Tree (a) 2 6 12 7 4 13 8 9 7 Strictly Complete binary tree (b) 1 2 2 3 5 6 5 9 8 1 4 3 2 3 6 4 7 8 10 Complete binary tree 3 5 9 10 6 11 12 7 13 Full binary tree (c) 14 15 (d) Figure 5.1 non-leaf nodes. A full binary tree with height h has 2h + 1 . a full binary tree of height 3 contains 23+1 – 1 = 15 nodes. of Information Technology .1 nodes. Figure 5.1 nodes. l =0 For example. A strictly binary tree with n leaves always contains 2n .

Lecture Notes 137 Dept. the tree of Figure 5. d External Nodes: 1.6 shows a sample tree illustrating both internal and external nodes. c. Array-based Implementation: Binary trees can also be stored in arrays.2. with letters as labels. b.6. For example. Internal and external nodes Data Structures for Binary Trees: 1. if a node has an index i. 4. External nodes are denoted by squares. this method wastes no space. but serves as a conceptual place holder for nodes to be inserted. An external node doesn’t exist. 2. c a d b 1 2 4 Internal Nodes: a. while its parent (if any) is found at index floor((i-1)/2) (assuming the root of the tree stored in the array at an index zero). We draw internal nodes using circles. The square node version is sometimes called an extended binary tree. 2. especially suited for complete and full binary trees. Arrays.3(c) is a complete binary tree having 5 leaves and 10 nodes. its children are found at indices 2i+1 and 2i+2. Pointer-based. 5 5 3 Figure 5. A binary tree with n internal nodes has n+1 external nodes. It is some times convenient to have another types of nodes.2. called an external node. Figure 5.2. of Information Technology . and pretend that all null child links point to such a node. 3. In this compact arrangement. 1 1 3 2 4 5 1 2 6 3 4 Complete Binary Tree but not strict (a) 5 2 7 4 Not C omplete and not strict (b) Not C omplete and not strict (c) Figure 5.A complete binary tree with n leaves that is not strictly binary has 2n nodes. Examples of complete and incomplete binary trees Internal and external nodes: We define two terms: Internal nodes and external nodes.4. and if the tree is a complete binary tree.2. An internal node is a tree node having at least one–key and possibly some children.

of Information Technology . data RightChild root NULL node *root = NULL. Figure 5.2. However. particularly during a preorder traversal.2. int data. Structure definition. expensive to grow and wastes space proportional to 2h . it requires contiguous memory. The disadvantages of linked representation of binary tree includes: • Given a node structure. node: LeftC hild Empty Tree: typedef struct binarytree node.6. but it is wasteful for many other binary trees. The structure definition. the left child field denoted as LeftChild. In linked representation each node in a binary has three fields.This method benefits from more compact storage and better locality of reference.2. 0 1 2 3 4 5 6 Linked Representation (Pointer based): Array representation is good for complete binary tree. struct binarytree { struct binarytree *LeftChild. • Memory spaces are wasted for storing NULL pointers for the nodes. struct binarytree *RightChild. as it requires the moment of potentially many nodes to reflect the change in level number of this node. node representation and empty tree Lecture Notes 138 Dept. To overcome this difficulty we represent the binary tree in linked representation. }.7. it is difficult to determine its parent node.6 and the linked representation of binary tree using this node structure is given in figure 5. If any sub-tree is empty then the corresponding pointer’s LeftChild and RightChild will store a NULL value. If the tree itself is empty the root pointer will store a NULL value. node representation empty binary tree is shown in figure 5.n for a tree of height h with n nodes. which have no subtrees. data field denoted as data and the right child field denoted as RightChild. The advantage of using linked representation of binary tree is that: • Insertion and deletion involve no data movement and no movement of nodes except the rearrangement of pointers. The representation suffers from insertion and deletion of node from the middle of the tree.

1. 3. By visit. The steps for traversing a binary tree in inorder traversal are: 1. Lecture Notes 139 Dept. The algorithm for inorder traversal is as follows: void inorder(node *root) { if(root != NULL) { inorder(root->lchild). using inorder. the left subtree of a node is traversed before the right subtree.3. of Information Technology . Postorder 4. 2. Recursive Traversal Algorithms: Inorder Traversal: In the case of inorder traversal. Visit the root. Visit the right subtree. Binary Tree Traversal Techniques: A tree traversal is a method of visiting every node in the tree. There are four common ways to traverse a binary tree: 1. Level order In the first three traversal methods. The difference among them comes from the difference in the time at which a root node is visited.A root B D C E F A G B H C I D X H X X I X E X X F X X G X X Figure 5.7. Preorder 2. using inorder. 5. you may wish to print the contents of the nodes. For example.2.3. we mean that some type of operation is performed. Visit the left subtree. the root of each subtree is visited after its left subtree has been traversed but before the traversal of its right subtree begins. Linked representation for the binary tree 5. Inorder 3.

The steps for traversing a binary tree in postorder traversal are: 1. using preorder. The algorithm for postorder traversal is as follows: void postorder(node *root) { if( root != NULL ) { postorder (root -> lchild). Visit the root. The algorithm for preorder traversal is as follows: void preorder(node *root) { if( root != NULL ) { print root -> data. 2. 2. } Preorder Traversal: In a preorder traversal. using preorder. So. each root is visited after its left and right subtrees have been traversed. Visit the right subtree. using postorder 3. print (root -> data). Preorder search is also called backtracking. This is nothing but a breadth first search technique. of Information Technology . inorder(root->rchild). } } Postorder Traversal: In a postorder traversal. The level order traversal requires a queue data structure. 3. Visit the left subtree. Visit the left subtree. using postorder. } } Level order Traversal: In a level order traversal. it is not possible to develop a recursive procedure to traverse the binary tree in level order. each root node is visited before its left and right subtrees are traversed. postorder (root -> rchild). Visit the root. preorder (root -> rchild). the nodes are visited level by level starting from the root. The steps for traversing a binary tree in preorder traversal are: 1. Lecture Notes 140 Dept. preorder (root -> lchild). Visit the right subtree. and going from left to right.} print root -> data.

I n or d er a n d l ev e l or d er T r av er s i n g 141 Dept. P o st . T. H. of Information Technology . F . R. G . F . G . inorder and level order. G . Z • L e v e l o r d e r t r a v e rs a l y ie lds: P. G . W . I. H . G . C . j++) { if(tree[j] != NULL) print tree[j] -> data. A • Ino r d e r t r a v e rs a l y ie lds: D. T. E . B . D. H. F . S. C . Z. F . S. A B C E D • P r eo r d e r t r a v e rs a l y ie lds: A . post. P • Ino r d e r t r a v e rs a l y ie lds: B. B . P o st . W . S. Y. F . j < ctr. T. W Y T Z W Bi n a ry T r e e • Pr e. E . inorder and level order. H. B. R. W . C . post. P. for(j = 0. Y. F . E . H. G . P F B S H R G Lecture Notes P r eo r d e r t r a v e rs a l y ie lds: P. H . B. } } Example 1: Traverse the following binary tree in pre. I • L e v e l o r d e r t r a v e rs a l y ie lds: A . S. T. H . H . Z • Po sto r d e r t r a v e rs a l y ie lds: B. G . E . A . R. Y. G . Y. Z. I F H G I Bi n a ry T r e e Pr e. C .The algorithm for level order traversal is as follows: void levelorder() { int j. D. F . B . I • Po sto r d e r t r a v e rs a l y ie lds: D. F . R. B . I n or d er a n d l ev e l or d er T r av er s i n g Example 2: Traverse the following binary tree in pre.

5 . M . E • Po sto r d e r t r a v a rs a l y ie lds: K . I n or d er a n d l ev e l or d er T r av er s i n g Building Binary Tree from Traversal Pairs: Sometimes it is required to construct a binary tree if its traversals are known. 5 . A • Ino r d e r t r a v a rs a l y ie lds: K . C . 2 . H . E . B . H .Example 3: Traverse the following binary tree in pre. 11 . 4 . C • L e v e l o r d e r t r a v e rs a l y ie lds: A . 2 7 2 5 6 P r eo r d e r t r a v e rs a l y ie lds: 2. 2 . 7 . 11 .3. 9 . G . E . then the first node is the root node. post. L . L . 4 • Po sto r d e r t r a v a rs a l y ie lds: 2. K . 7 . 7 . However any of the two traversals are given then the corresponding tree can be drawn uniquely: • • • Inorder and preorder Inorder and postorder Inorder and level order The basic principle for formulation is as follows: If the preorder traversal is given. K . G . all the nodes in the left sub-trees and right sub-trees of the root node can be identified using inorder. D. L . 11 . 6 . P r eo r d e r t r a v e rs a l y ie lds: A . H . 11 . A B C H K L M Bi n a ry T r e e 5. E . Lecture Notes 142 Dept. 5 . A . M E D G • Pr e. B . Once the root node is identified. 9 • L e v e l o r d e r t r a v e rs a l y ie lds: 2.2. H . 2 • Ino r d e r t r a v a rs a l y ie lds: 2. 6 . 9 . 5 . P o st . B . of Information Technology . 9 . 5 . 4 . 4 9 11 5 • 4 Bi n a ry T r e e Pr e. G . C . M . inorder and level order. 5 . 6 . C . 5 . 2 . From a single traversal it is not possible to construct unique binary tree. D. 6 . Same technique can be applied repeatedly to form sub-trees. D. D. 5 . P o st . M . inorder and level order. L . I n or d er a n d l ev e l or d er T r av er s i n g Example 4: Traverse the following binary tree in pre. G . If the postorder traversal is given then the last node is the root node. 7 . post. B .

binary tree cannot be obtained uniquely. Lecture Notes 143 Dept. we get the left and right sub trees: Left sub tree is: D G B Right sub tree is: H E I C F The Binary tree upto this point looks like: A D G B H E I C F To find the root. Example 1: Construct a binary tree from a given preorder and inorder sequence: Preorder: A B D G C E H I F Inorder: D G B A H E I C F Solution: From Preorder sequence A B D G C E H I F. The Binary tree upto this point looks like: A B H E I C F D G To find the root. the root of tree is: B From the inorder sequence D G B. given preorder and postorder traversals. alternatively. we can find that D and G are to the left of B. left and right sub trees for D G: From the preorder sequence D G.It can be noted that. the root is: A From Inorder sequence D G B A H E I C F. of Information Technology . two traversal are essential out of which one should be inorder traversal and another preorder or postorder. we can find that there is no left node to D and G is at the right of D. left and right sub trees for D G B: From the preorder sequence B D G. the root of the tree is: D From the inorder sequence D G. for the purpose mentioned.

we can find that H is at the left of E and I is at the right of E. the root of the left sub tree is: C From the inorder sequence H E I C F. of Information Technology . The Binary tree upto this point looks like: A B C E D G H F I Example 2: Construct a binary tree from a given postorder and inorder sequence: Inorder: D G B A H E I C F Postorder: G D B H I E F C A Lecture Notes 144 Dept. left and right sub trees for H E I C F: From the preorder sequence C E H I F. the root of the tree is: E From the inorder sequence H E I. left and right sub trees for H E I: From the preorder sequence E H I. we can find that H E I are at the left of C and F is at the right of C. The Binary tree upto this point looks like: A B C D F H E I G To find the root.The Binary tree upto this point looks like: A B H E I C F D G To find the root.

left and right sub trees for D G: From the postorder sequence G D. the root of tree is: B From the inorder sequence D G B. The Binary tree upto this point looks like: A B H E I C F D G To find the root. Lecture Notes 145 Dept. the root of the left sub tree is: C From the inorder sequence H E I C F. left and right sub trees for D G B: From the postorder sequence G D B. the root of the tree is: D From the inorder sequence D G. left and right sub trees for H E I C F: From the postorder sequence H I E F C. we can find that is no left subtree for D and G is to the right of D. we can find that H E I are to the left of C and F is the right subtree for C. we get the left and right sub trees: Left sub tree is: D G B Right sub tree is: H E I C F The Binary tree upto this point looks like: A D G B H E I C F To find the root. we can find that D G are to the left of B and there is no right subtree for B. of Information Technology . the root is: A From Inorder sequence D G B A H E I C F.Solution: From Postorder sequence G D B H I E F C A. The Binary tree upto this point looks like: A B H E I C F D G To find the root.

we get the left and right sub trees: Left sub tree is: n1 n2 n3 n4 n5 Right sub tree is: n7 n8 n9 The Binary tree upto this point looks like: n6 n1 n2 n3 n4 n5 Lecture Notes n7 n8 n9 146 Dept. the root of the tree is: E From the inorder sequence H E I. we can find that H is left subtree for E and I is to the right of E. the root is: n6 From Inorder sequence n1 n2 n3 n4 n5 n6 n7 n8 n9.The Binary tree upto this point looks like: A C B D F H E I G To find the root. The Binary tree upto this point looks like: A B C D F E G H I Example 3: Construct a binary tree from a given preorder and inorder sequence: Inorder: n1 n2 n3 n4 n5 n6 n7 n8 n9 Preorder: n6 n2 n1 n4 n3 n5 n9 n7 n8 Solution: From Preorder sequence n6 n2 n1 n4 n3 n5 n9 n7 n8. of Information Technology . left and right sub trees for H E I: From the postorder sequence H I E.

of Information Technology . the root of the tree is: n4 From the inorder sequence n3 n4 n5. left and right sub trees for n7 n8: From the preorder sequence n7 n8. we can find that n1 is to the left of n2 and n3 n4 n5 are to the right of n2. left and right sub trees for n3 n4 n5: From the preorder sequence n4 n3 n5.To find the root. we can find that n3 is to the left of n4 and n5 is at the right of n4. The Binary tree upto this point looks like: n6 n9 n2 n4 n1 n3 n7 n8 n5 To find the root. we can find that n7 and n8 are at the left of n9 and no right subtree of n9. The Binary tree upto this point looks like: n6 n2 n1 n7 n8 n9 n4 n3 n5 To find the root. the root of the left sub tree is: n9 From the inorder sequence n7 n8 n9. left and right sub trees for n7 n8 n9: From the preorder sequence n9 n7 n8. the root of the tree is: n7 Lecture Notes 147 Dept. The Binary tree upto this point looks like: n6 n2 n1 n7 n8 n9 n3 n4 n5 To find the root. left and right sub trees for n1 n2 n3 n4 n5: From the preorder sequence n2 n1 n4 n3 n5. the root of tree is: n2 From the inorder sequence n1 n2 n3 n4 n5.

The Binary tree upto this point looks like: n6 n9 n2 n4 n1 n3 n7 n5 n8 Example 4: Construct a binary tree from a given postorder and inorder sequence: Inorder: n1 n2 n3 n4 n5 n6 n7 n8 n9 Postorder: n1 n3 n5 n4 n2 n8 n7 n9 n6 Solution: From Postorder sequence n1 n3 n5 n4 n2 n8 n7 n9 n6. we can find that n1 is to the left of n2 and n3 n4 n5 are to the right of n2. we can find that is no left subtree for n7 and n8 is at the right of n7. left and right sub trees for n1 n2 n3 n4 n5: From the postorder sequence n1 n3 n5 n4 n2. the root of tree is: n2 From the inorder sequence n1 n2 n3 n4 n5. of Information Technology . The Binary tree upto this point looks like: n6 n2 n1 Lecture Notes n7 n8 n9 n3 n4 n5 148 Dept.From the inorder sequence n7 n8. we get the left and right sub trees: Left sub tree is: n1 n2 n3 n4 n5 Right sub tree is: n7 n8 n9 The Binary tree upto this point looks like: n6 n1 n2 n3 n4 n5 n7 n8 n9 To find the root. the root is: n6 From Inorder sequence n1 n2 n3 n4 n5 n6 n7 n8 n9.

we can find that n7 and n8 are to the left of n9 and no right subtree for n9. left and right sub trees for n3 n4 n5: From the postorder sequence n3 n5 n4. The Binary tree upto this point looks like: n6 n2 n1 n9 n7 n8 n4 n3 n5 To find the root.To find the root. we can find that n3 is to the left of n4 and n5 is to the right of n4. left and right sub trees for n7 n8 and n9: From the postorder sequence n8 n7 n9. The Binary tree upto this point looks like: n6 n2 n1 n7 n8 n9 n4 n3 n5 To find the root. the root of the tree is: n7 From the inorder sequence n7 n8. the root of the left sub tree is: n9 From the inorder sequence n7 n8 n9. of Information Technology . we can find that there is no left subtree for n7 and n8 is to the right of n7. The Binary tree upto this point looks like: n6 n2 n1 n7 n4 n3 Lecture Notes n9 n5 n8 149 Dept. left and right sub trees for n7 and n8: From the postorder sequence n8 n7. the root of the tree is: n4 From the inorder sequence n3 n4 n5.

Binary Tree Creation and Traversal Using Arrays: This program performs the following operations: 1. temp = (node*) malloc(sizeof(node)). }. tree[i]->rchild = tree[i * 2 + 2]. typedef struct tree node. } Lecture Notes 150 /* left child */ /* right child */ Dept.h> # include <stdlib. printf("\n Enter Data: "). do { if( j > 0 ) { tree[ i * 2 + 1 ] = getnode(). i=0. j--. } i++.3. 5. return temp. temp->rchild = NULL. j = ctr. j--. 7. node* getnode() { node *temp . Creates a complete Binary Tree Inorder traversal Preorder traversal Postorder traversal Level order traversal Prints leaf nodes Finds height of the tree created # include <stdio. } while( j > 0). tree[0] = getnode(). 3.5. 6. j--. node *tree[100]. struct tree* rchild.3. scanf("%d". of Information Technology . tree[i]->lchild = tree[i * 2 + 1]. printf("\n How many nodes you want: "). char data[10]. 4.temp->data). } void create_fbinarytree() { int j. temp->lchild = NULL. scanf("%s".&ctr). 2. } if( j > 0 ) { tree[i * 2 + 2] = getnode().h> struct tree { struct tree* lchild. int ctr.

inorder(root->rchild).root->data). preorder(root->lchild). j < ctr. print_leaf(root->rchild). } Lecture Notes 151 Dept.root->data). } } int height(node *root) { if(root == NULL) { return 0. postorder(root->rchild). } } void preorder(node *root) { if( root != NULL ) { printf("%3s". } } void levelorder() { int j. printf("%3s".root->data). } } void print_leaf(node *root) { if(root != NULL) { if(root->lchild == NULL && root->rchild == NULL) printf("%3s ". } } void postorder(node *root) { if( root != NULL ) { postorder(root->lchild).void inorder(node *root) { if( root != NULL ) { inorder(root->lchild). printf("%3s". print_leaf(root->lchild). of Information Technology .root->data). preorder(root->rchild). j++) { if(tree[j] != NULL) printf("%3s".tree[j]->data). for(j = 0.

if(root->lchild == NULL && root->rchild == NULL) return 0.temp->data). printf("\n Level Order Traversal: ").h> # include <stdlib. 2. height(tree[0])). printf("\n Inorder Traversal: "). typedef struct tree node. Binary Tree Creation and Traversal Using Pointers: This program performs the following operations: 1. inorder(tree[0]). printf("\n Leaf Nodes: "). node *Q[50]. 4. temp->lchild = NULL. fflush(stdin). Creates a complete Binary Tree Inorder traversal Preorder traversal Postorder traversal Level order traversal Prints leaf nodes Finds height of the tree created Deletes last node Finds height of the tree created # include <stdio.4. printf("\n Enter Data: "). levelorder(). 8. node* getnode() { node *temp . print_leaf(tree[0]). height(root->rchild))). printf("\n Preorder Traversal: "). }. create_fbinarytree(). } Lecture Notes 152 Dept. return temp. int node_ctr. 7. else return (1 + max(height(root->lchild). 3. of Information Technology . temp->rchild = NULL. preorder(tree[0]).3. 5. } void main() { int i. printf("\n Postorder Traversal: "). } 5. postorder(tree[0]). printf("\n Height of Tree: %d ". 9. char data[10]. scanf("%s". struct tree* rchild. 6. temp = (node*) malloc(sizeof(node)).h> struct tree { struct tree* lchild.

of Information Technology . else { node_ctr = 0.0). if(root == NULL) printf("\n Empty TREE "). make_Queue(root. } } printf("\n Node %s has Right SubTree(Y/N) ".&option). } } delete_node(node *root. if( option=='Y' || option == 'y') { root->rchild = getnode(). create_binarytree(root->lchild).root->data).int parent) { if(root != NULL) { node_ctr++. make_Queue(root->rchild. } else { root->rchild = NULL. index = node_ctr-1. if( root != NULL ) { printf("\n Node %s has Left SubTree(Y/N)". } } void make_Queue(node *root. create_binarytree(root->rchild). scanf("%c". node_ctr++. fflush(stdin).parent*2+2). make_Queue(root->lchild. create_binarytree(root->rchild). Q[index] = NULL. if( option=='Y' || option == 'y') { root->lchild = getnode().root->data).&option). if( 2* parent + 1 == index ) Q[parent]->lchild = NULL.void create_binarytree(node *root) { char option. Lecture Notes 153 Dept. Q[parent] = root. node_ctr++. create_binarytree(root->lchild). int parent) { int index = 0. parent = (index-1) /2. fflush(stdin). scanf("%c". node_ctr = 1.parent*2+1). } else { root->lchild = NULL.

} void print_tree(node *root. printf("%3s". } } void print_leaf(node *root) { if(root != NULL) { if(root->lchild == NULL && root->rchild == NULL) printf("%3s ".i<line. height(root->rchild))). postorder(root->rchild). } } int height(node *root) { if(root == NULL) return -1.root->data).line+1). inorder(root->rchild). of Information Technology . print_leaf(root->lchild). root->data). else return (1 + max(height(root->lchild).i++) Lecture Notes 154 Dept. for(i=0. } } void preorder(node *root) { if( root != NULL ) { printf("%3s". if(root != NULL) { print_tree(root->rchild."). printf("%3s".. } printf("\n Node Deleted . printf("\n").root->data). preorder(root->rchild). int line) { int i.else } Q[parent]->rchild = NULL. void inorder(node *root) { if(root != NULL) { inorder(root->lchild).root->data). print_leaf(root->rchild). } } void postorder(node *root) { if( root != NULL ) { postorder(root->lchild). preorder(root->lchild).

break. do { ch = menu(). Lecture Notes 155 Dept.} } printf(" "). Level Order Traversal"). Print Binary Tree "). printf("\n 8. } void main() { int i. void level_order(node *Q[]. preorder(root). printf("\n 10. case 2 : printf("\n Inorder Traversal: "). break. Postorder Traversal "). create_binarytree(root). switch( ch) { case 1 : if( root == NULL ) { root = getnode(). printf("\n 2.line+1). i < ctr .. return ch. clrscr(). Print Height of Tree "). printf("\n 1."). inorder(root). Preorder Traversal "). scanf("%d". printf("\n 7.Q[i]->data). printf("\n 5. } } int menu() { int ch. printf("%s". Leaf Node ").int ctr) { int i. print_tree(root->lchild. printf("\n 9. } break. Delete a node ").ch. printf("\n 6. i++) { if( Q[i] != NULL ) printf("%5s". printf("\n 3. Create Binary Tree "). of Information Technology . for( i = 0. node *root = NULL. &ch). Quit "). case 3 : printf("\n Preorder Traversal: "). } else { printf("\n Tree is already Created . Inorder Traversal "). root->data). printf("\n Enter Your choice: "). printf("\n 4.

Inorder Traversal: Initially push zero onto stack and then set root as vertex. make_Queue(root. Then repeat the following steps until the stack is empty: 1.case 4 : printf("\n Postorder Traversal: "). case 9 : delete_node(root. break. print_leaf(root)."). Non Recursive Traversal Algorithms: At first glance. Proceed down the left most path rooted at vertex. postorder(root). case 6 : printf("\n Leaf Nodes: "). } getch(). Use of the implicit function call stack may actually be faster due to special machine instructions that can be used. break.0). which may negate the savings we gain from storing only node pointers. some overhead is associated with the use of an explicit stack. break. }while(1).. then set right son of vertex as current vertex and return to step one. Pop and process the nodes on stack if zero is popped then exit.0).5. For instance.3. case 8 : printf("\n Print Tree \n"). case 5: printf("\n Level Order Traversal . level_order(Q. break. print_tree(root. If a vertex with right son exists. break. But the flat versions are not necessarily better. Algorithm inorder() { stack[1] = 0 vertex = root top: while(vertex ≠ 0) { push the vertex into the stack vertex = leftson(vertex) Lecture Notes 156 Dept. } 5. pushing each vertex onto the stack and stop when there is no left son of vertex. case 7 : printf("\n Height of Tree: %d ". break. 0). case 10 : exit(0). of Information Technology . 2. height(root)). it appears that we would always want to use the flat traversal functions since they use less stack space.node_ctr).

Then repeat the following steps until the stack is empty: 1. Pop and process the positive nodes (left nodes). The traversing ends after a vertex with no left child exists. of Information Technology . If a negative node is popped. Then repeat the following steps until the stack is empty: 1. Proceed down the left most path rooted at vertex. At each vertex of path push vertex on to stack and if vertex has a right son push –(right son of vertex) onto stack. Algorithm preorder( ) { stack[1] = 0 vertex = root. If zero is popped then exit. Proceed down the left most path by pushing the right son of vertex onto stack. 2.} pop the element from the stack and make it as vertex while(vertex ≠ 0) { print the vertex node if(rightson(vertex) ≠ 0) { vertex = rightson(vertex) goto top } pop the element from the stack and made it as vertex } } Preorder Traversal: Initially push zero onto stack and then set root as vertex. if(leftson(vertex) ≠ 0) vertex = leftson(vertex) else pop the element from the stack and made it as vertex } } Postorder Traversal: Initially push zero onto stack and then set root as vertex. if vertex ≠ 0 then return to step one otherwise exit. Lecture Notes 157 Dept. Pop the vertex from stack. then ignore the sign and return to step one. while(vertex ≠ 0) { print vertex node if(rightson(vertex) ≠ 0) push the right son of vertex into the stack. if any and process each vertex. 2.

H . G . of Information Technology . then set right son of vertex as current vertex and return to step one. K . M . H . A • Ino r d e r t r a v a rs a l y ie lds: K . P o st a n d I n or d er T r av er s i n g Inorder Traversal: Initially push zero onto stack and then set root as vertex. G . A . D. C . A C B E D G K H L M Bi n a ry T r e e • P r eo r d e r t r a v e rs a l y ie lds: A . H . L . If a vertex with right son exists. G . E . pushing each vertex onto the stack and stop when there is no left son of vertex. D. D. C . Then repeat the following steps until the stack is empty: 1. L . Lecture Notes 158 Dept.Algorithm postorder( ) { stack[1] = 0 vertex = root top: while(vertex ≠ 0) { push vertex onto stack if(rightson(vertex) ≠ 0) push – (vertex) onto stack vertex = leftson(vertex) } pop from stack and make it as vertex while(vertex > 0) { print the vertex node pop from stack and make it as vertex } if(vertex < 0) { vertex = . B . Proceed down the left most path rooted at vertex. Pop and process the nodes on stack if zero is popped then exit. B . 2.(vertex) goto top } } Example 1: Traverse the following binary tree in pre. post and inorder using non-recursive traversing algorithm. E • Po sto r d e r t r a v a rs a l y ie lds: K . C Pr e. M . B . L . E . M .

If a negative node is popped. Proceed down the left most path rooted at vertex. 2.CURRENT VERTEX STACK A 0 PUSH 0 0ABDGK PUSH the left most path of A PROCESSED NODES REMARKS K 0ABDG K POP K G 0ABD KG POP G since K has no right son D 0AB KGD POP D since G has no right son H 0AB KGD Make the right son of D as vertex 0ABHL KGD PUSH the leftmost path of H L 0ABH KGDL POP L H 0AB KGDLH POP H since L has no right son M 0AB KGDLH Make the right son of H as vertex 0ABM KGDLH PUSH the left most path of M M 0AB KGDLHM POP M B 0A KGDLHMB POP B since M has no right son A 0 KGDLHMBA Make the right son of A as vertex C 0CE KGDLHMBA PUSH the left most path of C E 0C KGDLHMBAE POP E C 0 KGDLHMBAEC Stop since stack is empty Postorder Traversal: Initially push zero onto stack and then set root as vertex. of Information Technology . then ignore the sign and return to step one. If zero is popped then exit. Then repeat the following steps until the stack is empty: 1. Pop and process the positive nodes (left nodes). At each vertex of path push vertex on to stack and if vertex has a right son push –(right son of vertex) onto stack. CURRENT VERTEX STACK A 0 PUSH 0 0 A –C B D –H G K PUSH the left most path of A with a -ve for right sons H Lecture Notes PROCESSED NODES REMARKS 0 A –C B D –H KG POP all +ve nodes K and G 0 A –C B D KG Pop H 159 Dept.

H. D and B 0A KGLMHDB Pop C 0ACE KGLMHDB PUSH the left most path of C with a -ve for right sons 0 KGLMHDBECA POP all +ve nodes E. Then repeat the following steps until the stack is empty: 1. if vertex ≠ 0 then return to step one otherwise exit. of Information Technology . M has no left path 0 ABDGKHLM Pop C 0 ABDGKHLMCE PUSH the right son of each vertex onto stack and process each vertex in the left most path.0 A –C B D H –M L KG PUSH the left most path of H with a -ve for right sons L 0 A –C B D H –M KGL POP all +ve nodes L M 0 A –C B D H KGL Pop M 0 A –C B D H M KGL PUSH the left most path of M with a -ve for right sons 0 A –C KGLMHDB POP all +ve nodes M. C has no right son on the left most path 0 ABDGKHLMCE Stop since stack is empty Lecture Notes 160 Dept. 2. C and A 0 KGLMHDBECA Stop since stack is empty C Preorder Traversal: Initially push zero onto stack and then set root as vertex. Pop the vertex from stack. if any and process each vertex. The traversing ends after a vertex with no left child exists. Proceed down the left most path by pushing the right son of vertex onto stack. CURRENT VERTEX STACK A 0 H M C PROCESSED NODES REMARKS PUSH 0 0CH ABDGK PUSH the right son of each vertex onto stack and process each vertex in the left most path 0C ABDGK POP H 0CM ABDGKHL PUSH the right son of each vertex onto stack and process each vertex in the left most path 0C ABDGKHL POP M 0C ABDGKHLM PUSH the right son of each vertex onto stack and process each vertex in the left most path.

4 . 4 .Example 2: Traverse the following binary tree in pre. If a vertex with right son exists. 7 . then set right son of vertex as current vertex and return to step one. 4 • Po sto r d e r t r a v a rs a l y ie lds: 2. of Information Technology . 11 . P o st a n d I n or d er T r av er s i n g Inorder Traversal: Initially push zero onto stack and then set root as vertex. post and inorder using non-recursive traversing algorithm. pushing each vertex onto the stack and stop when there is no left son of vertex. 5 . 5 . 6 . 6 . 2 • Ino r d e r t r a v a rs a l y ie lds: 2. CURRENT VERTEX STACK 2 0 PROCESSED NODES REMARKS 0272 2 027 2 7 02 27 6 0265 27 5 026 275 6 02 2756 11 0 2 11 2756 11 02 2 7 5 6 11 2 0 2 7 5 6 11 2 5 05 2 7 5 6 11 2 5 0 2 7 5 6 11 2 5 9 094 2 7 5 6 11 2 5 4 09 2 7 5 6 11 2 5 4 9 0 2 7 5 6 11 2 5 4 9 Lecture Notes 161 Stop since stack is empty Dept. 11 . 2 . Pop and process the nodes on stack if zero is popped then exit. 5 . Proceed down the left most path rooted at vertex. 6 . 9 . 7 . 11 . 5 . Then repeat the following steps until the stack is empty: 1. 2 . 9 5 6 5 • 9 11 4 Bi n a ry T r e e Pr e. 5 . 5 . 9 . 7 . 2 7 2 P r eo r d e r t r a v e rs a l y ie lds: 2. 2.

Postorder Traversal: Initially push zero onto stack and then set root as vertex. if vertex ≠ 0 then return to step one otherwise exit. Pop the vertex from stack. Proceed down the left most path rooted at vertex. of Information Technology . 2. if any and process each vertex. Then repeat the following steps until the stack is empty: 1. CURRENT VERTEX STACK 2 0 PROCESSED NODES 056 272 6 0 5 11 27265 11 05 2 7 2 6 5 11 05 2 7 2 6 5 11 5 09 2 7 2 6 5 11 5 9 0 2 7 2 6 5 11 5 9 4 0 2 7 2 6 5 11 5 9 4 Lecture Notes 162 REMARKS Stop since stack is empty Dept. If zero is popped then exit. then ignore the sign and return to step one. CURRENT VERTEX STACK 2 0 PROCESSED NODES REMARKS 0 2 –5 7 –6 2 2 0 2 –5 7 –6 2 6 0 2 –5 7 2 0 2 –5 7 6 –11 5 2 5 0 2 –5 7 6 –11 25 11 0 2 –5 7 6 11 25 0 2 –5 2 5 11 6 7 5 0 2 5 –9 2 5 11 6 7 9 02594 2 5 11 6 7 0 2 5 11 6 7 4 9 5 2 Stop since stack is empty Preorder Traversal: Initially push zero onto stack and then set root as vertex. 2. Pop and process the positive nodes (left nodes). At each vertex of path push vertex on to stack and if vertex has a right son push –(right son of vertex) onto stack. Then repeat the following steps until the stack is empty: 1. The traversing ends after a vertex with no left child exists. Proceed down the left most path by pushing the right son of vertex onto stack. If a negative node is popped.

we create a one-node tree and push a pointer to it onto a stack.4. If the symbol is an operand.4. of Information Technology . and the other (non leaf) nodes contain operators. 3. A pointer to this new tree is then pushed onto the stack.1 shows some more expression trees that represent arithmetic expressions given in infix form.4.1 Expression Trees An expression tree can be generated for the infix and postfix expressions. Lecture Notes 163 Dept. If the symbol is an operator. An algorithm to convert a postfix expression into an expression tree is as follows: 1. Once an expression tree is constructed we can traverse it in three ways: • • • Inorder Traversal Preorder Traversal Postorder Traversal Figure 5. + + + a / b d + c d + (a) (a + b) + (c / d) c a (b) ((a + b) + c) + d b / + * - + a x + y * b c a (c) ((-a) + (x + y)) / ((+b) * (c * a)) Figure 5. such as constants or variable names. Expression Trees: Expression tree is a binary tree.5. 2. we pop pointers to two trees T1 and T2 from the stack (T1 is popped first) and form a new tree whose root is the operator and whose left and right children point to T2 and T1 respectively. as is the case with the unary minus operator. It is also possible for a node to have only one child. because all of the operations are binary. The leaves of an expression tree are operands. Read the expression one symbol at a time.

and for each one–node tree is created and a pointer to the corresponding tree is pushed onto the stack. a ‘+’ is read. and e are read. + c + a Lecture Notes + bb d 164 e Dept. a new tree is formed. + a b c d e Now a ‘+’ is read. so two pointers to trees are popped.Example 1: Construct an expression tree for the postfix expression: a b + c d e + * * Solution: The first two symbols are operands. a b Next. so two trees are merged. and a pointer to it is pushed onto the stack. c. d. of Information Technology . so we create one-node trees and push pointers to them onto a stack. + a b Next.

Continuing. of Information Technology . two trees are merged. + * * + a b c + d e e For the above tree: Inorder form of the expression: a + b * c * d + e Preorder form of the expression: * + a b * c + d e Postorder form of the expression: a b + c d e + * * Example 2: Construct an expression tree for the arithmetic expression: (A + B * C) – ((D * E + F) / G) Solution: First convert the infix expression into postfix notation. Postfix notation of the arithmetic expression is: A B C * + D E * F + G / The first three symbols are operands. Lecture Notes 165 Dept. + + a * b c + d ee Finally. and a pointer to the final tree is left on the stack. the last symbol is read. so we pop two tree pointers and form a new tree with a ‘*’ as root. so we create one-node trees and pointers to three nodes pushed onto the stack. a ‘*’ is read.

so two pointers to trees are popped. D and E are read. and a pointer to it is pushed onto the stack. a ‘+’ is read.A B C Next. and a pointer to it is pushed onto the stack. a new tree is formed. so two pointers to trees are popped. of Information Technology . a new tree is formed. D + A E * B C Continuing. a ‘*’ is read. so we pop two tree pointers and form a new tree with a ‘*’ as root. and for each one–node tree is created and a pointer to the corresponding tree is pushed onto the stack. a ‘*’ is read. + A D * B Lecture Notes * E C 166 Dept. A * C B Next. + A * B C Next.

4. Run inorder traversal on the tree. the expression tree is as follows: + + A / + * B C 5.1.Proceeding similar to the previous steps. 2. Create the expression tree from the postfix expression B. Postfix to infix Postfix to prefix Prefix to infix Prefix to postfix Postfix to Infix: The following algorithm works for the expressions whose infix form does not require parenthesis to override conventional precedence of operators. when the last symbol is read. 4. 1. Lecture Notes 167 Dept. 2. 3. These can be as follows: 1. of Information Technology . Run preorder traversal on the tree. finally. Postfix to Prefix: The following algorithm works for the expressions to convert postfix to prefix: A. 3. Create the expression tree from the prefix expression B. Create the expression tree from the postfix expression B. Run inorder traversal on the tree. A. F * D G E Converting expressions with expression trees: Let us convert the following expressions from one type to another. A. Prefix to Infix: The following algorithm works for the expressions whose infix form does not require parenthesis to override conventional precedence of operators.

It may be empty. B D H A 1 1 1 1 0 0 1 - E 0 I 0 0 F C 0 1 0 G 0 0 Binary Search Tree: A binary search tree is a binary tree. Examples of binary search trees Lecture Notes 169 Dept. Every element has a key and no two elements have the same key. In order to have no loose Threads we will assume a head node for all threaded binary trees. If it is not empty then it satisfies the following properties: 1. The tree T is the left sub-tree of the head node.In the above figure two threads have been left dangling in LCHILD(H) and RCHILD(G). The keys in the right subtree are larger than the key in the root.6. 2. 16 16 12 11 20 14 12 19 11 13 14 13 Binary Search Tree 20 19 17 17 Not a Binary Search Tree (a) (b) Figure 5. Figure 5. The left and right subtrees are also binary search trees. 3. LBIT LCHILD DATA RCHILD RBIT 1 1 1 1 0 5. The Complete memory representation for the tree is as follows.2. 4. The keys in the left subtree are smaller than the key in the root.5(a) is a binary search tree.2.5.5(b) is not a binary search tree.2. whereas figure 5. of Information Technology .

and the right son is the node to the immediate right of the given node on the same horizontal line. we delete all the branches originating in every node except the left most branch. a forest can also be represented by a binary tree. 170 Dept. Differences between trees and binary trees: TREE BINARY TREE Each element in a tree can have any number of subtrees. Each element in a binary tree has at most two subtrees. the trees are called binary and full binary trees. of Information Technology . we distinguish between left and right subtrees). if any.7. Stage 2: • Once this is done then for any particular node. The general tree is also called as an m-ary tree.e. So.5. The subtrees in a tree are unordered. 5. Conversion from general tree to binary can be done in two stages. Stage 1: • As a first step. Such a binary tree will not have a right subtree. General Trees (m-ary tree): If in a tree. If the outdegree of every node is exactly equal to m or zero then the tree is called a full or complete m-ary tree. The subtrees of each element in a binary tree are ordered (i.7. we choose its left and right sons in the following manner: • Lecture Notes The left son is the node. • We draw edges from a node to the node on the right. which is situated at the same level. which is immediately below the given node.1. Furthermore. every tree can be uniquely represented by a binary tree. Converting a m-ary tree (general tree) to a binary tree: There is a one-to-one mapping between general ordered trees and binary trees. the outdegree of every node is less than or equal to m. For m = 2. the tree is called general tree.

1 2 4 Lecture Notes 5 7 3 8 6 11 171 9 10 12 13 0 Dept. of Information Technology .Example 1: Convert the following ordered tree into a binary tree: 1 2 3 6 7 4 8 5 9 10 11 Solution: Stage 1 tree by using the above mentioned procedure is as follows: 1 2 6 3 7 4 8 5 9 10 11 Stage 2 tree by using the above mentioned procedure is as follows: 1 2 6 3 7 8 4 5 9 10 11 Example 2: Construct a unique binary tree from the given forest.

inorder and postorder traversals of T’. Find the preorder. 2. 4. of Information Technology . 3. Compare them with the preorder and postorder traversals obtained for T’ with the general tree T. Find the corresponding binary tree T’. A B C D F E J G H Ge n e r a l t r e e T Lecture Notes 172 K L M P N Q Dept. Find the preorder traversal and the postorder traversal of T.Solution: Stage 1 tree by using the above mentioned procedure is as follows: 1 2 4 5 7 3 8 9 6 11 10 12 13 Stage 2 tree by using the above mentioned procedure is as follows (binary tree representation of forest): 1 2 7 3 4 5 8 6 11 9 9 10 12 13 Example 3: For the general tree shown below: 1.

. TM in preorder. Lecture Notes 173 Dept. Stage 1: The tree by using the above-mentioned procedure is as follows: A B C F D E G J H B 5 K L M P N Q Stage 2: The binary tree by using the above-mentioned procedure is as follows: A B C F D G 1E0 J H K L Bi n a rt t r e e T ’ M P N Q 2. TM. TM in postorder. 2) Process the root R. T3 consists of nodes J. ……. T2. C. Postorder: 1) Traverse the subtree T1.Solution: 1.. of Information Technology . 2) Traverse the subtree T1. preorder traversal and the postorder traversal of T are: Preorder: 1) Process the root R. T2. L. T2. M. ……. T2 consists of nodes F. N. G and H.. Suppose T is a general tree with root R and subtrees T1. ………. D and E. K. The The tree T has the root A and subtrees T1. P and Q. T2 and T3 such that: T1 consists of nodes B.

P. Preorder: A. Q. 5. B. K. D. A Comparing the preorder and postorder traversals of T’ with the general tree T: We can observer that the preorder of the binary tree T’ is identical to the preorder of the general T. and may or may not result into a visit to all nodes. K. F. G. F. E. M. (iv) Process root A. P. J. B. Breadth first search or traversal. P. L. N. B. D. 2. P. L. When the search necessarily involved the examination of every vertex in the tree. (ii) Traverse T1 in preorder: Process nodes B.8. M. (ii) Traverse T2 in postorder: Process nodes G. C. E. G. M. L. D. it is called the traversal. C. B. H. Q. N B. 1. The inorder traversal of the binary tree T’ is identical to the postorder traversal of the general tree T. M. B. Q. B. The postorder traversal of T is as follows: C. J. Search and Traversal Techniques for m-ary trees: Search involves visiting nodes in a tree in a systematic manner. G. L. N. N. D. G. M. H. D. (iii) Traverse T3 in postorder: Process nodes K. L. L. H. C. The preorder traversal of T is as follows: A. N. Q. There is no natural traversal of the general tree T which corresponds to the postorder traversal of its corresponding binary tree T’. Traversing of a tree can be done in two ways. Lecture Notes 174 Dept. K. J. (iv) Traverse T3 in preorder: Process nodes J. E. D. A 3. H. M. M. P. D. Q. H. The preorder traversal of T consists of the following steps: (i) Process root A. A Postorder: E. G. F. F. N Inorder: C. F. J. H. inorder and postorder traversals of the binary tree T’ are as follows: 4.A. E. J. H. (iii) Traverse T2 in preorder: Process nodes F. Q. The preorder. The postorder traversal of T consists of the following steps: (i) Traverse T1 in postorder: Process nodes C. E. K. N. Depth first search or traversal. P. G. K. K. E. C. J. Q. of Information Technology . F. P.

One simple way to implement depth first search is to use a stack data structure consisting of root node as a start state. B. G. It works very fine when search graphs are trees or lattices. then some successor of that state. To eliminate this keep a list of states previously visited. Depth first search will first visit S. But D has no successors. To illustrate this let us consider the tree shown below. then A. B. but can get struck in an infinite loop on graphs. C. A. E. E. and never permit search to return to any of them. C. Breadthfirst search is named because it visits vertices across the entire breadth. Breadth-first search discovers vertices in increasing order of distance. Disadvantages: 1. F. This is because depth first search can travel around a cycle in the graph forever.5. If depth first search reaches a state S without successors. the only goal state.8. Lecture Notes 175 Dept. so we must back up to A and try its second successor. D A E ST A RT J B S H C F G GOAL K I Suppose S is the start and G is the only goal state. But this doesn’t have any successors either. J doesn’t have any successors. The first successor of F is H. Breadth first search: Breadth-first search starts at root node S and “discovers" which vertices are reachable from S. trying to reach a goal state. C. we begin with root as a start state. And that’s G. So the solution path to the goal is S.8. H and G and the states considered were in order S. H. so we back up to H and try its second successor. J. Depth first search: In Depth first search. F. of Information Technology .1. But now we have tried all the successors of A and haven’t found the goal state G so we must back to ‘S’. D. so we back up to A again. so we back up to S again and choose its third successor. Now ‘S’ has a second successor. We cannot come up with shortest solution to the problem. 2.2. then some successor of that and so on. then some successor of the start state. 5. then it “backs up” that means it goes to the immediately previous state or predecessor formally. and the first of H is J. or if all the successors of a state S have been chosen (visited) and a goal state has not get been found. C has one successor. F. then D. the state whose successor was ‘S’ originally. But B has no successors.

The matrices with very low density are often good for use of the sparse format. A. In the figure. H and I at level 3. D. Sparse Matrices: A sparse matrix is a two–dimensional array having the value of majority elements as null. The matrix A produces: (3. reflecting the internal data structure. Here we first check all the immediate successors of the start state. H. and J. The elements are sorted by columns.To illustrate this let us consider the following tree: D A E ST A RT J B S H C F G GOAL K I Breadth first search finds states level by level. One approach is to use the linked list. In large number of applications. Then all the immediate successors of these. E. A. 1) 1 (2. G and K at level 4. B. D. will consider in order S. I. So we should devise technique such that only non-null elements will be stored. then all the immediate successors of these. C. start state S is at level 0. together with their row and column indices. 3) 4 (1. of Information Technology . A = ⎛0 ⎜ ⎜0 ⎜1 ⎜⎜ ⎝0 0 0 2 0 3 0 0 4 5⎞ ⎟ 0⎟ 0⎟ ⎟ 0 ⎟⎠ As far as the storage of a sparse matrix is concerned. 2) 3 (4. 2) 2 S= (3. storing of null elements is nothing but wastage of memory. B and C are at level 1. F. sparse matrices are involved.9. Breadth first search does not have the danger of infinite loops as we consider states in order of increasing number of branches (level) from the start state. 5. and so on until we find a goal node. e and F at level 2. One simple way to implement breadth first search is to use a queue data structure consisting of just a start state. So breadth first search. The density of the matrix is the number of non-zero elements divided by the total number of matrix elements. 4) 5 The printed output lists the non-zero elements of S. Suppose S is the start state and G is the goal state. For example. J and G and then stop because it has reached the goal node. Lecture Notes 176 Dept.

i++) { for( j = 0. if( matrix[i][j] == 0) { total_zeros++.h> # include <conio."). scanf("%d %d". */ # include <stdio. printf("\n The Representaion of Sparse Matrix is: \n"). } Lecture Notes 177 Dept. } } } } else printf("\n Given Matrix is Not a Sparse Matrix.matrix[i][j]). n. m.&m.j. total_elements. clrscr().i. i < m .h> main() { int matrix[20][20]. i++) { for( j = 0. &matrix[i][j]). j++) { if( matrix[i][j] != 0) { printf("\n %d \t %d \t %d". printf("\n Row \t Col \t Value "). j. } } } if(total_zeros > total_elements/2 ) { printf("\n Given Matrix is Sparse Matrix. &n). j < n . for(i = 0."). j++) { scanf("%d". total_elements = m * n. for(i = 0. total_zeros = 0.The program to represent sparse matrix: /* Check whether the given matrix is sparse matrix or not. i. printf("\n Enter Number of rows and columns: "). of Information Technology .. i < m . j < n . if so then print in alternative form for storage. printf("\n Enter data for sparse matrix: ")..

59 and 47? h. 6. Show what would be printed by each of the following. 77. 7. Prove that every node in a tree except the root node has a unique parent. 9 and 10 (in that order). Draw all the possible binary trees that have four leaves and all the nonleaf nodes have no children. Construct two binary trees so that their postorder traversal sequences are the same. Show how the tree would look after the deletion of 29. 12. Write a “C” function to compute the external path length of a binary tree. The maximum number of nodes in any level of a binary tree is also called the width of the tree. of Information Technology . and 3? 2. 2. Draw the binary search tree whose elements are inserted in the following order: 50 72 96 94 107 26 12 11 9 2 10 25 51 16 17 95 b. a. Lecture Notes 178 Dept. Prove that the inorder and postorder traversal sequences of a binary tree uniquely characterize the binary tree. 13. 5. What is the height of the tree? What nodes are on level? Which levels have the maximum number of nodes that they could contain? What is the maximum height of a binary search tree containing these nodes? Draw such a tree? What is the minimum height of a binary search tree containing these nodes? Draw such a tree? g. 4. f. 48. a. 11. Write a “C” function to determine the height of a binary tree. Write a “C” function to reconstruct a binary tree from its preorder and inorder traversal sequences. Show how the (original) tree would look after the insertion of nodes containing 63. How many different binary trees can be made from three nodes that contain the key value 1. Write a “C” function to count the number of leaf nodes in a binary tree. b. c. 9. Write a “C” function to reconstruct a binary tree from its postorder and inorder traversal sequences. 76. Write a “C” function to swap a binary tree. 8. An inorder traversal of the tree A postorder traversal of the tree A preorder traversal of the tree 3. e. 10. d. Write a “C” function to compute the internal path length of a binary tree.EXCERCISES 1. Write a “C” function to compute the maximum number of nodes in any level of a binary tree.

of Information Technology . EACKFHDBG FAEKCDHGB Convert the following general tree represented as a binary tree: 3 1 12 7 15 5 10 13 14 11 4 9 2 16 Lecture Notes 179 8 6 17 Dept. Inorder: Level order: n1 n2 n3 n4 n5 n6 n7 n8 n9 n6 n2 n9 n1 n4 n7 n3 n5 n8 Build the binary tree for the given inorder and preorder traversals: Inorder: Preorder: 17. 16. Inorder: Postorder: gdhbeiafjc ghdiebjfca C.14. Inorder: Postorder: n1 n2 n3 n4 n5 n6 n7 n8 n9 n1 n3 n5 n4 n2 n8 n7 n9 n6 C. Build the binary tree from the given traversal techniques: A. 15. Inorder: Level order: gdhbeiafjc abcdefghij Build the binary tree from the given traversal techniques: A. Inorder: Preorder: n1 n2 n3 n4 n5 n6 n7 n8 n9 n6 n2 n1 n4 n3 n5 n9 n7 n8 B. Inorder: Preorder: gdhbeiafjc abdgheicfj B.

Complete binary tree C. the post-order traversal sequence is: A. n – 1 C. A B D H I E C F G J K [ C ] 8. Root node D.2 D. n C. H I D E B F J K G C A D. H D I B E A F C J G K B. A B C D E F G H I J K C. consists of________ edges. Adjacency matrix B. H I D E B F J K G C A D. 2n D. 1. 2n [ B ] A B D H C E I FI G UR E 1 F G J K 7. the pre-order traversal sequence is: A. H I D E B F J K G C A D. A tree with n vertices. The maximum number of nodes at any level is: A. H D I B E A F C J G K B. For the Binary tree shown in fig. For the Binary tree shown in fig. log n [ A ] 6. Adjacency list C. Binary search tree [ B ] 3. Incidence matrix D. n B. n . 1. H D I B E A F C J G K B. n + 1 B. Leaf node B. Strictly binary tree B. A B C D E F G H I J K C. Full binary tree D. the in-order traversal sequence is: A. leaf node [ C ] 5. The node that has no children is referred as: A. Parent node C.Multiple Choice Questions 1. non-leaf node D. A binary tree in which all the leaves are on the same level is called as: A. A B D H I E C F G J K [ B ] Lecture Notes 180 Dept. A B D H I E C F G J K [ D ] 9. of Information Technology . The children of a same parent node are called as: A. adjacent node C. Sibblings [ C ] 2. Sibblings B. A. All of the above [ C ] 4. 1. A B C D E F G H I J K C. For the Binary tree shown in fig. How can the graphs be represented? A.

of Information Technology ] . Which is the correct order for Kruskal’s minimum spanning tree algorithm to add edges to the minimum spanning tree for the figure 2 shown above: A. For the figure 3. 57 C. G) then (A. G) then (B. For the figure 2 shown above. The tree is neither complete nor full. 48 B. 4 B. 8 [ B ] 16. 6 D. E) then (C. 2 C. how many leaves does it have? A. D) then (D. 2 C. For the figure 3. 6 B. how many of the nodes have at least one sibling? A. For the figure 3. the cost of the minimal spanning tree is: A. G) B. For the figure 3. The tree is both full and complete. F) then (D. 8 [ B ] 13. 0 C. E) then (F. none of the above [ B ] 11. D) then (D. (A. 8 [ A 14. 8 [ D ] 15. 4 B. C. C) C. 4 D. C) then (A. 32 [ A ] 14 2 1 FIGURE 3 11 3 10 7 30 40 12. 2 D. 5 C. [ A ] Lecture Notes 181 Dept.23 28 B 9 D 25 A 15 4 1 36 C Node 20 A E 16 3 F G 17 Adjacency List BCD B ADE C ADF D ABCEFG E BDG F CDG G FDE FIGURE 2 and its adjacency list 10. D) then (E. 7 B. (A. For the figure 3. what is the depth of the tree? A. The tree is full but not complete. which statement is correct? A. D. B) then (A. 68 D. The tree is complete but not full. B. both A and B D. 3 D. How many descendants does the root have? A.

There nodes A. of Information Technology . What is the order of visited using a post-order traversal? 3 7 10 11 14 30 40 C. 4 B. 1 2 is a tree in the box at the top of this section. What is the order of nodes visited using a pre-order traversal? A. D. Every binary tree is either complete or full. What is the minimum possible depth of T? A. [ A ] 24. 1 3 2 7 10 40 30 11 14 3 14 7 10 11 40 30 D. data[2*i + 1] B. 14 2 1 3 11 10 7 30 40 [ ] 20. 14 2 1 3 11 10 7 30 40 [ ] 19. data[i+1] C. C. Every full binary tree is also a complete binary tree. Every non-empty tree has exactly one root node. 4 D. There nodes A. data[i+2] D. 14 2 1 3 11 10 7 30 40 [ ] 18. D. B. 1 2 is a tree in the box at the top of this section. 1 3 2 7 10 40 30 11 14 B. 1 2 3 14 7 10 11 40 30 D. where will the right child's value be stored? A. 3 C. C. 1 2 B. Select the one true statement. 15 [ D ] 21. 8 B. 1 3 2 7 10 40 30 11 14 3 14 7 10 11 40 30 D. Every binary tree has at least one node.17. Select the one FALSE statement about binary trees: A. What is the minimum number of nodes in a full binary tree with depth 3? A. There is a tree in the box at the top of this section. A. If this node has a right child. Every node has at most two children. Suppose T is a binary tree with 14 nodes. 3 D. What is the order of visited using an in-order traversal? 3 7 10 11 14 30 40 C. B. Every complete binary tree is also a full binary tree. 0 C. Every non-root node has exactly one parent. No binary tree is both complete and full. Consider the node of a complete binary tree whose value is stored in data[i] for an array implementation. 5 [ B ] 23. data[2*i + 2] [ C ] 14 2 16 1 Figure 4 5 4 Lecture Notes 182 Dept. 1 2 B. [ C ] 22. 1 2 3 7 10 11 14 30 40 C.

Postorder. 5 3 7 2 4 6 B. of Information Technology . C. Postorder C. 3 7 3 6 D. Which traversals of tree 1 and tree 2. Inorder. will produce the same sequence of node names? A. 5 B. 5 7 5 14 2 2 16 6 1 5 4 Lecture Notes 183 Dept. Suppose we remove the root. Postorder D. 2 E. Inorder B. What will be the new root? A. 4 [ D ] A B G C Tr e e 2 D E G F E F I H J I Tr e e 1 C D H A B J 26. Postorder. Preorder. For the binary search tree shown in figure 4. replacing it with something from the left subtree. 1 D. Inorder [ C ] 27.25. 16 C. Which among the following is not a binary search tree? [ C ] A.

F. D. 11 C. B.23 11 27 7 6 17 9 25 FI G UR E 5 14 28. 2 . Queue C. D. G. ⎣ log2 n ⎦ + 1 B. Lecture Notes 184 Dept. 7 → 9 The number of nodes in a complete binary tree of depth d is: C. A B. G. If the inorder and preorder traversal of a binary tree are D. E. 27 → 11 D.1 [ B ] [ B ] 31. The data structure used by level order traversal of binary tree is: A. G. F. 25 → 27 C. F. E. H. n2 D. of Information Technology . For the binary search tree shown in figure 5. F. 2n [ C ] 32. G. For the binary search tree shown in figure 5. none of the above B. F. A. none of the above [ A ] 30. log n C. linked list B. H. B. E D. B. B. C. A. Stack D. C respectively then. 14 [ ] 29. The depth of a complete binary tree with n nodes is: A. C. D. C and A. D. G. C. 2k A. F. H. G. after deleting 23 from the binary search tree what node will be at the root? A. C. E. 2d k D. the postorder traversal of that tree is: A. B. 27 B. A [ A ] 33. H. H. B. E. H. A C. after deleting 23 from the binary search tree what parent → child pair does not occur in the tree? A. 25 D. D. E. 11 → 7 B.

1.1. Lecture Notes 185 Dept. A directed graph is also called as digraph.1. E).5. Introduction to Graphs: Graph G is a pair (V.5. v) for nodes in G there is a path from u to v and also a path from v to u.. the digraph shown in figure 6. A directed graph G is said to be connected.5. where V is a finite set of vertices and E is a finite set of edges. We will often denote n = |V|. of Information Technology . while an edge with no orientation is our undirected edge.5.1 (e) is strongly connected.(a) and figure 6. A graph G is connected if and only if there is a simple path between any two nodes in G. If all the edges are directed. The graph which has such function assigned is called weighted graph. Figure 6. in which the vertices are represented by circles and the edges by lines. The graph of figure 6. or strongly connected.1 Various Graphs We can assign weight function to the edges: wG(e) is a weight of edge e ∈ E.5. e = |E|. The graph in figure 6. A complete graph with n nodes will have n(n-1)/2 edges. B D A C E E G C (a) v4 v3 v4 (e) v2 (b) v1 v2 v4 D F v1 (d) v1 B A v3 v1 v1 v2 v4 (f) v3 v2 v2 v3 (c) v3 (g) v4 v5 v6 v7 Figure 6. G is said to be unilaterally connected if for any pair (u.(d) are complete graphs. For example. On the other hand.e. if for each pair (u.5. arrow head) is a directed edge. If all the edges in a graph are undirected.5.Chapter 6 Graphs 6. v) of nodes in G there is a path from u to v or a path from v to u. For example. then the graph is a directed graph. An edge with an orientation (i. then the graph is an undirected graph.1(b) is a directed graph.1(a) is an undirected graph. A graph G is said to be complete if every node a in G is adjacent to every other node v in G. A graph is generally displayed as figure 6.1.

let us consider the digraph shown in figure 6. Number of edges in T is n-1. 3. 4. E’) is a sub-graph of graph G = (V. E) is a tree that contains all vertices of V and is a subgraph of G. T2 and T3. For example. the graphs of figure 6. . 2. If we remove the root node of a given tree then it becomes forest. Any two vertices in T are connected by a unique simple path. Tree is a connected acyclic graph (there aren’t any sequences of edges that go around in a loop).1(c) and figure 6.1(a). A single graph can have multiple spanning trees. then the new graph will contain a cycle. indegree(v1) = 2 outdegree(v1) = 1 indegree(v2) = 2 outdegree(v2) = 0 A path is a sequence of vertices (v1.5. v2. where for all i. A P B T1 C D E Q X Y R Z F T2 T3 A Forest F A graph that has either self loop or parallel edges or both is called multi-graph.5.1(f). If we add any edge into T. A Forest is a set of disjoint trees. . E) iff V’ ⊆ V and E’ ⊆ E. there is a cycle in figure 6. then T becomes disconnected. of Information Technology . A path is simple if all vertices in the path are distinct. If any edge is removed from T. A graph G’ = (V’.1 (f) and figure 6. If a graph (digraph) does not have any cycle then it is called acyclic graph. figure 6. For example. (vi.1 (g) are acyclic graphs. The number of outgoing edges from a vertex is called out-degree (denote outdeg(v)).1(d). The following figure shows a forest F that consists of three trees T1. .5. . Lecture Notes 186 Dept. Then 1. If there is a path containing one or more edges which starts from a vertex Vi and terminates into the same vertex then the path is known as a cycle. vi+1) ε E. A spanning tree of a graph G = (V. . vk). Let T be a spanning tree of a graph G. .5.5.The number of incoming edges to a vertex v is called in–degree of the vertex (denote indeg(v)). For example.5.

Both algorithms differ in their methodology. but both eventually end up with the MST. Lecture Notes 189 Dept. Prim’s algorithm. Example: G: A gr a p h G: T hr e e ( of ma n y p o s s i b l e) s p a n n i n g t r e e s f r o m gr a p h G: 2 2 4 G: 3 3 5 6 1 1 A w e i g ht e d gr a p h G: T h e mi n i m a l s p a n n i n g t r e e f r o m w e i g ht e d gr a p h G: Let's consider a couple of real-world examples on minimum spanning tree: • One practical application of a MST would be in the design of a network. • Another useful application of MST would be finding airline routes. Minimum spanning tree (MST) is a spanning tree with the smallest possible weight. Weight of a spanning tree w(T) is the sum of weights of all edges in T. Kruskal's algorithm uses edges. a group of individuals. Minimum spanning tree. can be constructed using any of the following two algorithms: 1. The vertices of the graph would represent cities.e. thereby connecting everyone at a minimum cost. and whose edge set is a subset of the edge set of the given graph. MST can be applied to optimize airline routes by finding the least costly paths with no cycles. Kruskal’s algorithm and 2. For instance..6. who are separated by varying distances. it can be used to determine the least cost paths with no cycles in this network. and the edges would represent routes between the cities. Minimum Spanning Tree (MST): A spanning tree for a connected graph is a tree whose vertex set is the same as the vertex set of the given graph. any connected graph will have a spanning tree.3. i. In Prim’s algorithm at any instance of output it represents tree whereas in Kruskal’s algorithm at any instance of output it may represent tree or not. Although MST cannot do anything about the distance from one connection to another. of Information Technology . and Prim’s algorithm uses vertex connections in determining the MST. wish to be connected together in a telephone network.

which will always be the minimum cost. Example 1: Construct the minimal spanning tree for the graph shown below: 10 1 50 2 45 40 30 3 35 25 4 5 55 20 15 6 Arrange all the edges in the increasing order of their costs: Cost 10 15 20 25 30 35 40 45 50 55 Edge (1. w) from E. 2) (3.1) edges have been added. The order in which the edges are chosen. Repeat the steps 3. keep on adding the shortest (least cost) edge. 6) (1. Different MST’s may result. Choose an edge (v. 3. picking an edge with the least weight in a MST). If T contains fewer than n . 5. of Information Technology . A greedy algorithm chooses some local optimum (i. does not matter. in this case. Kruskal’s Algorithm for minimal spanning tree is as follows: 1. 6) Lecture Notes 190 Dept. w) to T else discard (v. If (v. Sometimes two or more edges may have the same cost. proceed to step 6. 4.3.1. w) from E of lowest cost.6. 4 and 5 as long as T contains less than n . 3) (5. 5) (1. 2. 5) (2.1 edges and E is not empty otherwise. while avoiding the creation of cycles.e. 6) (2. Make the tree T empty. until (n . Kruskal’s Algorithm This is a greedy algorithm. w) does not create a cycle in T then Add (v. but they will all have the same total cost.1 edges then print no spanning tree. 4) (3. 6) (4. Kruskal's algorithm works as follows: Take a graph with 'n' vertices. 5) (2. w) 6. Delete (v.

Reject 1 2 4 Finally. It is included in the spanning tree. 6 Lecture Notes 191 Dept. 5) 35 The edge between the vertices 1 and 4 is discarded as its inclusion creates a cycle. of Information Technology . 2 3 4 5 6 (1. 2 3 4 5 6 (4. This completes the tree.The stages in Kruskal’s algorithm for minimal spanning tree is as follows: EDGE COST (1. the edge between vertices 3 and 5 is considered and included in the tree built. 2 3 4 5 6 (2. 4) 30 (3. 6) 15 1 Next. 3 5 The cost of the minimal spanning tree is 105. 6) 20 1 The edge between vertices 4 and 6 is next included in the tree. 2) 10 STAGES IN KRUSKAL’S ALGORITHM 1 The edge between vertices 1 and 2 is the first edge selected. 2 3 4 REMARKS 5 6 (3. the edge between vertices 3 and 6 is selected and included in the tree. 6) 25 1 The edge between vertices 2 and 6 is considered next and included in the tree.

7) 1 14 The edge between vertices 2 and 7 is next included in the tree.Example 2: Construct the minimal spanning tree for the graph shown below: 28 1 10 2 14 6 24 25 16 7 3 18 5 22 12 4 Solution: Arrange all the edges in the increasing order of their costs: Cost 10 12 14 16 18 22 24 25 28 Edge (1. It is included in the spanning tree. 7) (2. 6) 10 STAGES IN KRUSKAL’S ALGORITHM 1 REMARKS The edge between vertices 1 and 6 is the first edge selected. 7) (5. 4) 1 12 Next. 6) (3. of Information Technology . 4) (2. 7) (4. 2) The stages in Kruskal’s algorithm for minimal spanning tree is as follows: EDGE COST (1. 2 6 3 7 5 4 Lecture Notes 192 Dept. 2 6 3 7 5 4 (3. the edge between vertices 3 and 4 is selected and included in the tree. 6) (1. 3) (4. 5) (5. 2 6 3 7 5 4 (2.

Minimal cost spanning tree is a spanning tree for which the sum of the edge labels is as small as possible The slight modification of the spanning tree algorithm yields a very simple algorithm for finding an MST. This completes the tree. 5 4 6. 6) 25 The edge between the vertices 5 and 7 is discarded as its inclusion creates a cycle. Reject 1 Finally. Minimal cost spanning tree is a connected undirected graph G in which each edge is labeled with a number (edge labels may signify lengths. Reject 1 The edge between vertices 4 and 7 is considered next and included in the tree. 5) 22 The edge between the vertices 4 and 7 is discarded as its inclusion creates a cycle.(2.2.3. 2 6 3 7 5 4 (4. we must be selective . of Information Technology . the edge between vertices 5 and 6 is considered and included in the tree built. To find a Minimal cost spanning tree. This simple modified algorithm of spanning tree is called prim's algorithm for finding an Minimal cost spanning tree. any vertex not in the tree but connected to it by an edge can be added.we must always add a new vertex for which the cost of the new edge is as small as possible. 7) 24 (5. 2 6 3 7 The cost of the minimal spanning tree is 99. This tree is called as minimal cost spanning tree. In the spanning tree algorithm. MINIMUM-COST SPANNING TREES: PRIM'S ALGORITHM A given graph can have many spanning trees. we have to select a cheapest one. Prim's algorithm is an example of a greedy algorithm. From these many spanning trees. weights other than costs). 2 6 3 7 5 4 (5. 7) 18 (4. Lecture Notes 193 Dept. 3) 1 16 The edge between vertices 2 and 3 is next included in the tree.

Algorithm Prim (E. cost [1:n. if ((near [k] ≠ 0) and (cost [k. 2] := near [j]. t [1.2 additional edges for t. mincost := cost [k. 1:n] is the cost adjacency matrix of an n vertex graph such that cost [i. j) exists. j] is either a positive real number or ∝ if no edge (i. near [j] := 0 for k:= 1 to n do // Update near[]. mincost := mincost + cost [j. { Let j be an index such that near [j] ≠ 0 and cost [j. else near [i] := k. 1] := j. 1:2]. t [1. near [j]] is minimum. (t [i. near [j]].1 do // Find n .Prim’s Algorithm: E is the set of edges in G. of Information Technology . for i :=1 to n do // Initialize near if (cost [i. t [i. 2] := l. 2]) is an edge in the minimum-cost spanning tree. l]. } return mincost. l] < cost [i. cost. n. A minimum spanning tree is computed and stored as a set of edges in the array t [1:n-1. t) { Let (k. 1] := k. t [i. 4 B 3 2 D 1 2 E 4 A 6 C 4 1 2 2 G F 1 Solution: ⎛0 ⎜ ⎜3 ⎜6 ⎜ The cost adjacency matrix is ⎜ ∞ ⎜ ⎜∞ ⎜∞ ⎜⎜ ⎝∞ Lecture Notes 3 6 ∞ ∞ ∞ 0 2 4 ∞ ∞ 2 0 1 4 2 4 1 0 2 ∞ ∞ 4 2 0 2 ∞ 2 ∞ 2 0 ∞ ∞ 4 1 1 194 ∞⎞ ⎟ ∞⎟ ∞⎟ ⎟ 4⎟ ⎟ 1⎟ 1⎟ ⎟ 0 ⎟⎠ Dept. t [i. l) be an edge of minimum cost in E. } EXAMPLE: Use Prim’s Algorithm to find a minimal spanning tree for the graph shown below starting with the vertex A. near [k] :=near [l] := 0. for i:=2 to n . near [k]] > cost [k. 1]. The final cost is returned. j])) then near [k] := j. k]) then near [i] := l.

Next A 0 0 * B 0 3 A C 0 2 B D 0 1 C E 1 2 D F 0 2 C G 1 1 E Step 2: B 3 A 0 2 C 44 D ∝ E ∝ F 1 D 4 E ∝ G Step 3: B 3 A 0 ∝ 2 C 2 F 1 D 2 E 2 F 1 D 2 E 2 F G Step 4: A 0 2 C 4 G Step 5: B A 0 3 2 1 G C Lecture Notes 195 Dept. Next A 0 0 * B 0 3 A C 0 2 B D 1 1 C E 1 4 C F 1 2 C G 1 ∝ A Vertex Status Dist. Next A 0 0 * B 1 3 A C 1 6 A D 1 ∝ A E 1 ∝ A F 1 ∝ A G 1 ∝ A Vertex Status Dist. of Information Technology .The stepwise progress of the prim’s algorithm is as follows: Step 1: B A 3 ∝ D ∝ E ∝ F 6 0 C ∝ G Vertex Status Dist. Next A 0 0 * B 0 3 A C 1 2 B D 1 4 B E 1 ∝ A F 1 ∝ A G 1 ∝ A Vertex Status Dist. Next A 0 0 * B 0 3 A C 0 2 B D 0 1 C E 1 2 D F 1 2 C G 1 4 D Vertex Status Dist.

.4. producing matrices called A1. A d j ac e nc y M at r i x W a r s h a l l’ s A l g or it h m A l l P a ir s Rec h a b i l it y M at r i x It begins with the adjacency matrix for the given graph. the final matrix An. This information is conveniently displayed by adjacency matrix for the graph. of Information Technology . In warshall’s algorithm the matrix Ai contains information about the existence of i–paths. . contains the desired connectivity information. . It is also called the transitive closure of the original adjacency matrix. y] = Ai-1 [x. y] ۷ (Ai-1 [x. An and then stops. It doesn’t need to know the lengths of the edges in the given directed graph. . Next A 0 0 * B 0 3 A C 0 2 B D 0 1 C E 0 2 D F 1 1 G G 0 1 E G Vertex Status Dist. The update rule for computing Ai from Ai-1 in warshall’s algorithm is: Ai [x. in which a ‘1’ indicates the existence of an edge and ‘0’ indicates non-existence. i] ٨ Ai-1 [i. which are connected and zero entry indicates a pair. A2. Thus when the algorithm stops. A one entry in the matrix Ai will correspond to the existence of i–paths and zero entry will correspond to non-existence. . 1 D 2 E 1 F 1 Reachability Matrix (Warshall’s Algorithm): Warshall’s algorithm requires knowing which edges exist and which does not. which are not.Step 6: B A 1 3 0 2 2 C G Vertex Status Dist. . which is called A0. This matrix is called a reachability matrix or path matrix for the graph. y]) Lecture Notes 196 ---- (1) Dept. A one entry indicates a pair of vertices. and then updates the matrix ‘n’ times. Next A 0 0 * B 0 3 A C 0 2 B D 0 1 C E 0 2 D F 0 1 G G 0 1 E D 1 E 1 F Step 7: B A 0 3 2 C 6.

3] ۷ (A0[3. 1] ٨ A0[1. 4] ۷ (A0[4. Before doing so. since in Boolean algebra 1 + (anything) = 1. 2] = A1[3. 1] ۷ (A1[2. 2]) = 0 ۷ (0 ٨ 0) = 0 Lecture Notes 197 Dept. A2 must be calculated from A1. 2] ٨ A1[2. 4]) = 0 ۷ (0 ٨ 0) = 0 A1[2. 1] ٨ A0[1. 4] ۷ (A0[1. 1] = A0[3. 1] ۷ (A1[1. A2[1. 4] = A0[3. 2] ۷ (A0[2. 2] = A1[2. 2]) = 0 ۷ (0 ٨ 1) = 0 A1[3. 1] = A0[1. 1] ٨ A0[1. 2] = A0[2. 1]) = 0 ۷ (0 ٨ 0) = 0 A1[2. of Information Technology . 4] ۷ (A0[3. 1] = A1[3. 1] ٨ A0[1. 2]) = 0 ۷ (0 ٨ 0) = 0 A2[3. 4] = A0[4. 1] ۷ (A0[3. 4]) = 0 ۷ (1 ٨ 0) = 0 1 ⎛0 ⎜ 2 ⎜0 A1 = ⎜ 3 0 ⎜ 4 ⎜⎝1 1 1 0 1 0 0 1 1 0⎞ ⎟ 1⎟ 0⎟ ⎟ 0 ⎟⎠ Next. 1] = A1[1. 1]) = 0 ۷ (0 ٨ 0) = 0 A1[3. 2] ۷ (A1[2. 4] = A1[1. 1] ٨ A0[1.Example 1: Use warshall’s algorithm to calculate the reachability matrix for the graph: 4 1 4 5 6 7 11 1 2 3 7 We begin with the adjacency matrix of the graph ‘A0’ 1 ⎛0 ⎜ 2 ⎜0 A0 = ⎜ 3 0 ⎜ 4 ⎜⎝1 1 1 0 1 0 0 1 1 0⎞ ⎟ 1⎟ 0⎟ ⎟ 0 ⎟⎠ The first step is to compute ‘A1’ matrix. 2] ٨ A1[2. 2] ٨ A1[2. 1] ٨ A0[1. A1[1. 2] ٨ A1[2. there are only nine entries in A0 that need to be updated. we notice that only one entry in A0 must remain one in A1. To do so we will use the updating rule – (1). but again we need to update the 0 entries. 4] = A0[1. 1]) = 0 ۷ (0 ٨ 0) = 0 A2[2. 4] ۷ (A1[1. 1] ۷ (A1[3. Since these are only nine zero entries in A0. 1] ٨ A0[1. 3] = A0[3. 2] ۷ (A0[3. 4]) = 0 ۷ (1 ٨ 1) = 1 A2[2. 1]) = 0 ۷ (1 ٨ 0) = 0 A2[1. 1]) = 0 ۷ (0 ٨ 0) = 0 A1[1. 1] ٨ A0[1. 1]) = 0 ۷ (0 ٨ 0) = 0 A2[3. 1] = A0[2. 1] = A1[2. 4]) = 0 ۷ (0 ٨ 0) = 0 A1[4. 1] ۷ (A0[1. 2] ٨ A1[2. 1] ٨ A0[1. 2]) = 0 ۷ (0 ٨ 1) = 0 A1[3. 2] ٨ A1[2. 3]) = 0 ۷ (0 ٨ 1) = 0 A1[3. 1] ۷ (A0[2. 2] ۷ (A1[3. 2] = A0[3.

2] = A3 [3. 2]) = 0 ۷ (1 ٨ 1) = 0 ۷ 1 = 1 A4[3. 4] ٨ A3 [4. 4] ۷ (A3 [3. 1]) = 0 ۷ (1 ٨ 1) = 0 ۷ 1 = 1 A4[2. This matrix is the reachability matrix for the graph. 3] ٨ A2[3. 4] ٨ A3 [4. 4]) = 0 ۷ (0 ٨ 0) = 0 1 ⎛0 ⎜ 2 ⎜0 A3 = ⎜ 3 0 ⎜ 4 ⎜⎝1 1 1 0 1 0 0 1 1 1⎞ ⎟ 1⎟ 0⎟ ⎟ 1 ⎟⎠ Once A3 is calculated. 4] ٨ A3 [4. 1] ۷ (A3 [3. 4] = A3 [3. 2]) = 0 ۷ (0 ٨ 0) = 0 A3[3. 3] ٨ A2[3. 2] ۷ (A3 [3. 1] = A3 [3. 1] ۷ (A3 [2. 2] ٨ A1[2. there is no path from vertex 3 back to itself. 1] ۷ (A2[3. 4] ٨ A3 [4. 2] ۷ (A2[3. 3] ۷ (A2[3. 4] = A1[4. 2] = A3 [2. 4] ٨ A3 [4. 1] = A2[2. 4] ۷ (A2[3. 1] ۷ (A3 [1. 1]) = 0 ۷ (1 ٨ 0) = 0 A3[2. 2]) = 0 ۷ (1 ٨ 0) = 0 A3[3. 3] ۷ (A1[3. 3] = A3 [3. 4]) = 0 ۷ (1 ٨ 1) = 1 1 ⎛0 ⎜ 2 ⎜0 A2 = ⎜ 3 0 ⎜ 4 ⎜⎝1 1 1 0 1 0 0 1 1 1⎞ ⎟ 1⎟ 0⎟ ⎟ 1⎟⎠ This matrix has only seven 0 entries.A2[3. 2] ۷ (A2[2. 2] = A2[3. 3] = A2[3. 4] ۷ (A1[3. 1]) = 0 ۷ (0 ٨ 1) = 0 ۷ 0 = 0 A4[3. 2] ٨ A1[2. 3] ٨ A2[3. This is because as can be seen in the graph. 1] = A2[3. 3]) = 0 ۷ (0 ٨ 0) = 0 A3[3. 2] ۷ (A3 [2. 4] ۷ (A1[4. 4] ٨ A3 [4. 4]) = 0 ۷ (0 ٨ 1) = 0 A2[4. 4] = A2[3. 1] = A3 [2. 3] ٨ A2[3. and so to compute A3. A3[1. we need to do only seven computations. 1]) = 0 ۷ (0 ٨ 0) = 0 A3[3. A4[1. 1]) = 0 ۷ (1 ٨ 0) = 0 A3[2. 3] ٨ A2[3. 4] ٨ A3 [4. 3] ۷ (A3 [3. 4] = A1[3. 1] = A2[1. 1]) = 0 ۷ (1 ٨ 1) = 0 ۷ 1 = 1 A4[2. we use the update rule to calculate A4 and stop. 2] = A2[2. 3] ٨ A2[3. 3] ٨ A2[3. 1] = A3 [1. 4]) = 0 ۷ (0 ٨ 1) = 0 ۷ 0 = 0 1 ⎛1 ⎜ 2 ⎜1 A4 = ⎜ 3 0 ⎜ 4 ⎜⎝1 1 1 1 1 0 0 1 1 1⎞ ⎟ 1⎟ 0⎟ ⎟ 1⎟⎠ Note that according to the algorithm vertex 3 is not reachable from itself 1. of Information Technology . 1] ۷ (A2[1. 3]) = 0 ۷ (0 ٨ 1) = 0 ۷ 0 = 0 A4[3. 3] = A1[3. 2]) = 0 ۷ (0 ٨ 1) = 0 ۷ 0 = 0 A4[3. 1] ۷ (A2[2. 2] ٨ A1[2. 3]) = 0 ۷ (0 ٨ 1) = 0 A2[3. Lecture Notes 198 Dept.

Depth first search and traversal: Depth first search of undirected graph proceeds as follows: First we examine the starting node V. G D C. G. C. F. A F C D B E J G K A Gr a p h G Node Adjacency List A F. which has an unvisited vertex 'W' adjacent to it and initiate a depth first search from W. Exit. D. 3. of Information Technology . K F A. DFT algorithm is similar to BFT except now use a STACK instead of the QUEUE. C. E. Traverse the graph shown below in breadth first order and depth first order. The algorithm for depth first traversal on a graph G is as follows. Push the starting node A into STACK and change its status to the waiting state (STATUS = 2). J Adjacency list for graph G Lecture Notes 200 Dept. Pop the top node N from STACK. 4. K K E. Process N and change the status of N to the processed state (STATUS = 3). This algorithm is similar to the inorder traversal of binary tree. E. G. and change their status to the waiting state (STATUS = 2). G C A. J. Next an unvisited vertex 'W' adjacent to 'V' is selected and a depth first search from 'W' is initiated. The search terminates when no unvisited vertex can be reached from any of the visited ones.5. C. Push all the neighbors of N that are in the ready state (STATUS = 1).6. D G B. E. 1. When a vertex 'U' is reached such that all its adjacent vertices have been visited. E. F. K J D. B B A. J E C. Again field STATUS is used to tell us the current status of a node. D. Initialize all nodes to the ready state (STATUS = 1). B. we back up to the last vertex visited. Repeat the following steps until STACK is empty: a. 2.2. This algorithm executes a DFT on graph G beginning at a starting node A. b. C. Example 1: Consider the graph shown below.

Depth-first search and traversal: The steps involved in depth first traversal are as follows: Current Node Stack Processed Nodes A Status A B C D E F G J K 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 A BCF A 3 2 2 1 1 2 1 1 1 F BCD AF 3 2 2 2 1 3 1 1 1 D BCEJ AFD 3 2 2 3 2 3 1 2 1 J BCEK AFDJ 3 2 2 3 2 3 1 3 2 K BCEG AFDJK 3 2 2 3 2 3 2 3 3 G BCE AFDJKG 3 2 2 3 2 3 3 3 3 E BC AFDJKGE 3 2 2 3 3 3 3 3 3 C B AFDJKGEC 3 2 3 3 3 3 3 3 3 B EMPTY AFDJKGECB 3 3 3 3 3 3 3 3 3 For the above graph the depth first traversal sequence is: A F D J K G E C B.Breadth-first search and traversal: The steps involved in breadth first traversal are as follows: Current Node QUEUE Processed Nodes A Status A B C D E F G J K 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 A FCB A 3 2 2 1 1 2 1 1 1 F CBD AF 3 2 2 2 1 3 1 1 1 C BDEG AFC 3 2 3 2 2 3 2 1 1 B DEG AFCB 3 3 3 2 2 3 2 1 1 D EGJ AFCBD 3 3 3 3 2 3 2 2 1 E GJK AFCBDE 3 3 3 3 3 3 2 2 2 G JK AFCBDEG 3 3 3 3 3 3 3 2 2 J K AFCBDEGJ 3 3 3 3 3 3 3 3 2 K EMPTY AFCBDEGJK 3 3 3 3 3 3 3 3 3 For the above graph the breadth first traversal sequence is: A F C B D E G J K. of Information Technology . Lecture Notes 201 Dept.

depth first order and construct the breadth first and depth first spanning trees. M K J L G.Example 2: Traverse the graph shown below in breadth first order. F E G. of Information Technology . J. then the vertices of graph G are visited in the order: A F E G L J K M H I C D B. D G A. C H G. E. E. B. D. G D E. I I H J G. list J for the graph G TheM adjacency G D E F The G ra ph G If the depth first traversal is initiated from vertex A. The depth first spanning tree is shown in the figure given below: A F B E G L H J I K D C M Depth first Traversal If the breadth first traversal is initiated from vertex A. K. then the vertices of graph G are visited in the order: A F B C G E D L H J M I K. The breadth first spanning tree is shown in the figure given below: A F E B C D G L H J M I K Breadth first traversal Lecture Notes 202 Dept. H. M L. J. L. A B C H I J K L M Node Adjacency List A F. G B A C A. L. C. F F A.

of Information Technology .Example 3: Traverse the graph shown below in breadth first order. 6. 7. 1 2 3 4 5 6 7 8 Graph G He ad Node s 1 2 3 2 1 4 5 3 1 6 7 4 2 8 5 2 8 6 3 8 7 3 8 8 4 5 6 7 A d j a c e n c y l is t f o r g r a p h G Depth first search and traversal: If the depth first is initiated from vertex 1. 5. 8. The depth first spanning tree is as follows: 1 2 4 3 5 6 7 8 Depth First Spanning Tree Lecture Notes 203 Dept. 4. depth first order and construct the breadth first and depth first spanning trees. 2. then the vertices of graph G are visited in the order: 1. 3.

How many edges are contained in a complete graph of “n” vertices. Give an example of a connected directed graph so that a depth first traversal of that graph yields a forest and not a spanning tree of the graph. 3. 5. 4. The breadth first spanning tree is as follows: 1 2 3 4 5 6 7 8 Breadth First Spanning Tree EXCERCISES 1. 6. Show that the number of spanning trees in a complete graph of “n” vertices is 2n-1 – 1. Construct a weighted graph for which the minimal spanning trees produced by Kruskal’s algorithm and Prim’s algorithm are different. 2. Write a “C” function to find out whether there is a path between any two vertices in a graph (i. Write a “C” function to generate the incidence matrix of a graph from its adjacency matrix. Show that the sum of degrees of all vertices in an undirected graph is twice the number of edges. 2. then the vertices of G are visited in the order: 1.e. 6. 9. Show that the number of vertices of odd degree in a finite graph is even. 4. 12. 8. 10. Rewrite the algorithms “BFSearch” and “DFSearch” so that it works on adjacency matrix representation of graphs. to compute the transitive closure matrix of a graph) 11. Write a “C” function to delete an existing edge from a graph represented by an adjacency list. Explain how existence of a cycle in an undirected graph may be detected by traversing the graph in a depth first manner. Prove that the edges explored by a breadth first or depth first traversal of a connected graph from a tree. 7. 8. Lecture Notes 204 Dept.Breadth first search and traversal: If the breadth first search is initiated from vertex 1. 5. 7. 3. of Information Technology .

Describe the algorithm to find a minimum spanning tree T of a weighted graph G. i) Breadth first spanning tree. 6 5 A B C 1 8 4 2 D E 3 14. c) Depth first spanning tree. g) Adjacency list. o) Minimal spanning tree using Kruskal’s and Prim’s algorithms. b) Adjacency list. h) Depth first spanning tree. of Information Technology . l) Adjacency list. Find the minimum spanning tree T of the graph shown below. n) Breadth first spanning tree. 8 6 1 1 5 7 2 4 6 2 7 9 3 3 8 10 4 10 15. 7 3 8 6 For the graph given below find the following: k) Linked representation of the graph. 4 1 2 5 16. j) Minimal spanning tree using Kruskal’s and Prim’s algorithms.13. 9 5 For the graph given below find the following: f) Linked representation of the graph. For the graph given below find the following: a) Linked representation of the graph. m) Depth first spanning tree. d) Breadth first spanning tree. 5 1 6 2 4 8 3 7 Lecture Notes 205 Dept. e) Minimal spanning tree using Kruskal’s and Prim’s algorithms.

F) then (D. (A. E) then (C. A B C D E F G B. A B C D E F G B. G) B. D) then (D. For the figure 1 shown above. n(n-1)/2 B. Incidence matrix B. Sub-graph C. Sibblings B. 48 B. of Information Technology . The depth-first traversal in graph is analogous to tree traversal: A. none of the above [ B ] 10. Level order [ C ] 3. non-leaf node D. Adjacency matrix C. G) then (A. the depth first spanning tree visiting sequence is: A. D) then (D. 2n D. Post-order D. B) then (A. For the figure 1 shown above. A B C D E F G D. The maximum number of nodes at any level is: A. none of the above [ 9. Acyclic graph B. G) then (B. Directed graph D. The children of a same parent node are called as: A. 15 4 1 Node B 17 G Adjacency List A BCD B ADE C ADF D ABCEFG E BDG F CDG G FDE FIGURE 1 and its adjacency list For the figure 1 shown above.Multiple Choice Questions 1. the cost of the minimal spanning tree is: A. 32 [ A ] Lecture Notes 206 B ] Dept. A graph with no cycle is called as: A. (A. All of the above [ D ] 2. adjacent node C. n . none of the above [ C ] 6. (n – 1)/2 [ C ] 5. 2n [ B ] 20 A 23 C 28 36 D 25 9 E 16 3 F 7. In-order C. 68 D. Complete graphs with n nodes will have__________ edges. How can the graphs be represented? A.1 C. A B C D E F G C. A. n/2 D. D) then (E. C) then (A. n C. n + 1 B. A B D C F G E D. none of the above [ B ] 8. A B D C F G E C. C) C. 57 C. Which is the correct order for Kruskal’s minimum spanning tree algorithm to add edges to the minimum spanning tree for the figure 1 shown above: A. both A and B D. the breadth first spanning tree visiting sequence is: A. Pre-order B. E) then (F. leaf node [ C ] 4. Adjacency list D.

O(n²) [ A ] [ B ] 19. O(m) C. What graph traversal algorithm uses a stack to keep track of vertices which need to be processed? A. starting at vertex A. O(n) D.) A. [ D ] 13. D. how many boolean values will be needed to represent G using an adjacency matrix? A. none of the above [ B ] 17. C Level order search B. Depth first search. Which graph representation allows the most efficient determination of the existence of a particular edge in a graph? A. What is the expected number of operations needed to loop through all the edges terminating at a particular vertex given an adjacency list representation of the graph? (Assume n vertices are in the graph and m edges terminate at the desired node. Depth-first search. Depth-first search. 20 C. Incidence matrix B. Breadth-first search. What algorithm might be used to find the best sequence of connections from one city to another? A. O(m) C. D. It must have at least one vertex. B. Edge lists. C. Breadth-first search. O(m²) B. What other property must a simple graph have? A. 40 D. 200 B. It must be undirected. What graph traversal algorithm uses a queue to keep track of vertices which need to be processed? A. D. O(m²) B.11. C. 400 [ 14. 3 A 1 2 B 3 1 C D 5 5 4 G 4 E 6 3 D ] FIGURE 3 1 F For the figure 3. A simple graph has no loops. It must have no multiple edges. A cycle-finding algorithm. D. O(n) D.) A. What is the expected number of operations needed to loop through all the edges terminating at a particular vertex given an adjacency matrix representation of the graph? (Assume n vertices are in the graph and m edges terminate at the desired node. O(n²) [ D ] 18. [ D ] 12. A shortest-path algorithm. B. of Information Technology . Suppose you have a directed graph representing all the flights that an airline flies. none of the above [ A ] 16. If G is an directed graph with 20 vertices. which is a correct order for Prim’s minimum spanning tree algorithm to add edges to the minimum spanning tree? Lecture Notes 207 Dept. Breadth first search. C Level order search B. An adjacency matrix. C. D. none of the above [ B ] 15. It must be directed.

(A. G) then (G. (A. C. G) then (A. C) then (E. B) then (C. A D D. The Depth-First Search Trace Algorithm [ ] 22. E) D. B) then (B. B A D C G F E C. G) then (A. (A. C → G B. which edge does not occur in the depth first spanning tree resulting from depth first search starting at node B: A. Edges D. F) then (A. Parallel edges [ D ] A B Node D G F C ] Adjacency List A D B AC C GDF D ---- E E C CD F EA G B FIGURE 4 and its adjacency list 24. E) C. which is a correct order for Kruskal’s minimum spanning tree algorithm to add edges to the minimum spanning tree? A. F → E C. B A C D G F E B. E) C. C) then (C. An adjacency matrix representation of a graph cannot contain information of: A. Which algorithm does not construct an in-tree as part of its processing? A. G) then (G. [ ] 23.A. C) then (E. B A D C G F E C. (A. Kruskal’s Minimum Spanning Tree Algorithm D. G) then (A. Nodes C. D. C) then (A. (A. E → C D. C) then (C. F) then (D. G) then (B. F) then (F. The set of all edges generated by BFS tree starting at node B is: A. G) then (B. D) then (C. B) then (C. D) then (C. F) then (F. F) then (F. For the figure 4. E) D. Prim’s Minimum Spanning Tree Algorithm C. C) then (A. The set of all edges generated by DFS tree starting at node B is: A. F) then (F. A D D. Dijkstra’s Shortest Path Algorithm B. D) B. B. D) B. C) then (A. D) then (A. C) then (A. B) then (A. G) then (A. F) then (A. D) then (C. D) then (C. Direction of edges B. C → F [ B ] 25. For the figure 3. Cannot be generated [ C ] Lecture Notes 208 Dept. (A. B A C D G F E B. The worst-case running time of Kruskal’s minimum-cost spanning tree algorithm on a graph with n vertices and m edges is: A. F) [ 21. Cannot be generated [ A ] 26. B) then (C. B) then (A. (A. E) then (E. D) then (A. E) then (E. of Information Technology . F) 20. B) then (C. B) then (B. F) then (D. (A.

This chapter introduces this important aspect of problem solving. Data structures and algorithms are linked each other. After developing programming techniques to represent information. There are many sorting techniques out of which we study the following. There are two types of search techniques. Heap sort There are two types of sorting techniques: 1. if some of the elements to be sorted are kept on the secondary storage. Selection sort and 4. it is called external sorting. Binary search Sorting allows an efficient arrangement of elements within a given data structure. Bubble sort 2. Till now we have seen about data structures and the techniques and algorithms used to access them. The other part of computer programming involves choosing the appropriate algorithm to solve the problem.Chapter 7 Searching and Sorting There are basically two aspects of computer programming. One is data organization also commonly called as data structures. In this technique. External sorting If all the elements to be sorted are present in the main memory then such sorting is called internal sorting on the other hand. of Information Technology . 7. It is a way in which the elements are organized systematically for some purpose. Linear or sequential search 2. Internal sorting 2. Searching is used to find the location where an element is available. 1. If the desired element is found in the list then the search is successful otherwise unsuccessful. They are: 1. Linear Search: This is the simplest of all searching techniques. an ordered or unordered list will be searched one by one from the beginning until the desired element is found. For example.1. Quick sort 3. a dictionary in which words is arranged in alphabetical order and telephone director in which the subscriber names are listed in alphabetical order. Lecture Notes 209 Dept. Here we study only internal sorting techniques. it is logical to proceed to manipulate it.

flag = 0. On an average you need [(n+1)/2] comparison’s to search an element. we’ll look at 12 elements before success For any element not in the list.Suppose there are ‘n’ elements organized sequentially on a List. else printf(“data not found”). 4. we’ll look at 2 elements before success 8. 20 If we are searching for: 45. 8. we’ll look at 8 elements before success 4. 9. 24. Lecture Notes 210 Dept. if it is second element two comparisons are necessary and so on. } Example 1: Suppose we have the following unsorted list: 45. 54. purely depends on where the element is stored in the list. we’ll look at 11 elements before success 20. you would need ’n’ comparisons. } index ++. one comparison will do. } if(flag == 1) printf(“Data found at %d position“. break. of Information Technology . 39. x) { index = 0. The time complexity of linear search is O(n). 77. 38. Determine whether element ‘x’ is present or not. linsrch(a[n]. The number of comparisons required to retrieve an element from the list. we’ll look at 4 elements before success 77. we’ll look at 9 elements before success 7. If search is not successful. we’ll look at 12 elements before failure. while (index < n) do { if (x == a[index]) { flag = 1. we’ll look at 3 elements before success 54. If it is the first element. we’ll look at 10 elements before success 9. 7. we’ll look at 1 element before success 39. index). 16. Algorithm: Let array a[n] stores n elements. we’ll look at 7 elements before success 16. we’ll look at 5 elements before success 38 we’ll look at 6 elements before success 24.

h> void linear_search(int a[]. of Information Technology .1. 2. &n). data found at 7th position. printf("\n Enter the elements: ").2. printf("\n Enter the number of elements: "). data not found. } 7. Searching for x = 82 Search successful. } } if(flag == 1) printf("\n Data found at location: %d". for(i = 0. 7. Searching for x = 7 Search successful. scanf("%d". &data). flag = 0. data. int n) { if(position < n) Lecture Notes 211 Dept.h> main() { int number[25]. i < n. A non-recursive program for Linear Search: # include <stdio. printf("\n Enter the element to be Searched: "). int position. Searching for x = 42 Search un-successful.1. int data. i. A Recursive program for linear search: # include <stdio. i < n.1. break. i++) { if(number[i] == data) { flag = 1. i+1). data found at 3rd position. scanf("%d". i++) scanf("%d". else printf("\n Data not found "). &number[i]). n.h> # include <conio. 3. for( i = 0.Example 2: Let us illustrate linear search on the following 9 elements: Index Elements 0 -15 1 -6 2 0 3 7 4 9 5 23 6 54 7 82 8 101 Searching different elements is as follows: 1.h> # include <conio. clrscr().

i++) { scanf("%d". n). &data). Since the array size is roughly halved after each comparison between ‘x’ and a[mid]. else linear_search(a. &a[i]). If x < a[mid] then ‘x’ must be in that portion of the file that precedes a[mid]. data. scanf("%d".2. If ‘x’ is not in the list then j is to set to zero (un successful search).{ if(a[position] == data) printf("\n Data Found at %d ". set j such that x = a[j] else return 0. where we find key a[mid]. if a[mid] > x. for(i = 0. 0. In case ‘x’ is present. i < n. then further search is only necessary in that part of the file which follows a[mid]. In Binary search we jump into the middle of the file. binary search is used to find the corresponding element from the list. Similarly. If we use recursive procedure of finding the middle key a[mid] of the un-searched portion of a file. position). Algorithm: Let array a[n] of elements in increasing order. and since an array of length ‘n’ can be halved only about log2n times before reaching a trivial length. n. When we are given a element ‘x’. then every un-successful comparison of ‘x’ with a[mid] will eliminate roughly half the un-searched portion from consideration. we have to determine a value ‘j’ such that a[j] = x (successful search). printf("\n Enter the number of elements: "). &n). and compare ‘x’ with a[mid]. data. determine whether ‘x’ is present. If x = a[mid] then the desired record has been found. } 7. and if so. position + 1. } printf("\n Enter the element to be seached: "). clrscr(). BINARY SEARCH If we have ‘n’ records which have been ordered by keys so that x1 < x2 < … < xn . } void main() { int a[25]. n). linear_search(a. data. printf("\n Enter the elements: "). scanf("%d". getch(). } else printf("\n Data not found"). the worst case complexity of Binary search is about log2n. n ≥ 0. i. of Information Technology . Lecture Notes 212 Dept.

while (low < high) do { mid = ⎣ (low + high)/2 ⎦ if (x < a[mid]) high = mid – 1. check 8 low = 1.binsrch(a[]. found If we are searching for x = 16: (This needs 4 comparisons) low = 1. check 8 low = 4. check 9 low = 5. high = 12. check 16. high = 2. found If we are searching for x = 9: (This needs 3 comparisons) low = 1. check 20. check 4. high = 12. check 20 low = 1. } return 0. mid = 13/2 = 6. mid = 6/2 = 3. high = 5. high = 5. high = n. mid = 13/2 = 6. check 20 low = 1. high = 2. mid = 10/2 = 5. check 8 low = 4. check 9. high = 5. mid = 13/2 = 6. Thus we have two sequences of integers approaching each other and eventually low will become greater than high causing termination in a finite number of steps if ‘x’ is not present. high = 2. mid = 6/2 = 3. found If we are searching for x = 7: (This needs 4 comparisons) low = 1. high = 5. high = 5. mid = 3/2 = 1. mid = 6/2 = 3. Example 1: Let us illustrate binary search on the following 12 elements: Index Elements 1 4 2 7 3 8 4 9 5 16 6 20 7 24 8 38 9 39 10 45 11 54 12 77 If we are searching for x = 4: (This needs 3 comparisons) low = 1. mid = 9/2 = 4. high = 12. mid = 6/2 = 3. mid = 13/2 = 6. high = 5. else if (x > a[mid]) low = mid + 1. mid = 9/2 = 4. of Information Technology . check 20 low = 1. check 20 low = 1. mid = 3/2 = 1. check 8 low = 1. found If we are searching for x = 8: (This needs 2 comparisons) low = 1. high = 12. found Lecture Notes 213 Dept. high = 12. mid = 4/2 = 2. check 4 low = 2. x) { low = 1. high = 12. found If we are searching for x = 20: (This needs 1 comparison) low = 1. check 20 low = 1. } low and high are integer variables such that each time through the loop either ‘x’ is found or low is increased by at least one or high is decreased by at least one. n. mid = 6/2 = 3. check 7. high = 5. mid = 13/2 = 6. check 8. mid = 13/2 = 6. high = 5. else return mid.

mid = 13/2 = 6. 4. check 54. needed to find all twelve items and dividing by 12. high = 12. high = 12. found If we are searching for x = 38: (This needs 4 comparisons) low = 1. mid = 22/2 = 11. high = 12. check 20 low = 7. high = 12. mid = 19/2 = 9. check 45. 38. check 24 low = 8. mid = 13/2 = 6. check 39 low = 7. mid = 19/2 = 9. 9. mid = 15/2 = 7. high = 12. mid = 19/2 = 9. high = 12. found The number of comparisons necessary by search element: 20 – requires 1 comparison. mid = 13/2 = 6. mid = 19/2 = 9. 54 – requires 3 comparisons and 7. check 77. mid = 22/2 = 11. check 24. found If we are searching for x = 77: (This needs 4 comparisons) low = 1. high = 12. mid = 19/2 = 9. Example 2: Let us illustrate binary search on the following 9 elements: Index Elements 0 -15 1 -6 2 0 3 7 4 9 5 23 6 54 7 82 8 101 Solution: The number of comparisons required for searching different elements is as follows: Lecture Notes 214 Dept. mid = 19/2 = 9. yielding 37/12 or approximately 3. high = 8. high = 12. check 39 low = 7. 24. check 39 low = 10. found If we are searching for x = 54: (This needs 3 comparisons) low = 1. mid = 16/2 = 8. mid = 13/2 = 6. check 20 low = 7. 8 and 39 – requires 2 comparisons. check 39. check 39 low = 10. high = 12. found If we are searching for x = 45: (This needs 4 comparisons) low = 1. 45. high = 8. mid = 13/2 = 6. check 20 low = 7. of Information Technology .If we are searching for x = 24: (This needs 3 comparisons) low = 1. check 20 low = 7. high = 8. high = 12. high = 12. check 39 low = 10. high = 12. mid = 22/2 = 11.08 comparisons per successful search on the average. mid = 20/2 = 10. 16. high = 12. check 20 low = 7. mid = 15/2 = 7. high = 12. 77 – requires 4 comparisons Summing the comparisons. check 54 low = 12. mid = 24/2 = 12. high = 10. found If we are searching for x = 39: (This needs 2 comparisons) low = 1. check 20 low = 7. check 54 low = 10. high = 12. check 38. mid = 13/2 = 6. high = 12.

Summing the comparisons needed to find all nine items and dividing by 9. a(2) < x < a(3).1. If x < a(1). a(6) < x < a(7) or a(7) < x < a(8) the algorithm requires 3 element comparisons to determine that ‘x’ is not present. There are ten possible ways that an un-successful search may terminate depending upon the value of x. of Information Technology .4 Time Complexity: The time complexity of binary search in a successful search is O(log n) and for an unsuccessful search is O(log n). Searching for x = 82: (Number of comparisons = 3) low high mid 1 9 5 6 9 7 8 9 8 found 3. Lecture Notes 215 Dept. a(5) < x < a(6). a(1) < x < a(2). Searching for x = 42: (Number of comparisons = 4) low high mid 1 9 5 6 9 7 6 6 6 7 6 not found 4. Thus the average number of element comparisons for an unsuccessful search is: (3 + 3 + 3 + 4 + 4 + 3 + 3 + 3 + 4 + 4) / 10 = 34/10 = 3. yielding 25/9 or approximately 2. For all of the remaining possibilities BINSRCH requires 4 element comparisons. If we are searching for x = 101: (Number of comparisons = 4) low high mid 1 9 5 6 9 7 8 9 8 9 9 9 found 2. Searching for x = -14: (Number of comparisons = 3) low high mid 1 9 5 1 4 2 1 1 1 2 1 not found Continuing in this manner the number of element comparisons needed to find each of nine elements is: Index Elements Comparisons 1 -15 3 2 -6 2 3 0 3 4 7 4 5 9 1 6 23 3 7 54 2 8 82 3 9 101 4 No element requires more than 4 comparisons to be found.77 comparisons per successful search on the average.

clrscr(). int high) { int mid .h> void bin_search(int a[]. mid-1). of Information Technology . } else { if(data < number[mid]) high = mid . } } if(flag == 1) printf("\n Data found at location: %d". for(i = 0. printf("\n Enter the number of elements: "). else low = mid + 1. if(a[mid] == data) printf("\n Element found at location: %d ". low.2. else Lecture Notes 216 Dept. while(low <= high) { mid = (low + high)/2. } 7.7. i. A non-recursive program for binary search: # include <stdio. low = 0. else { if(data < a[mid]) bin_search(a. i < n. mid + 1).h> # include <conio. i++) scanf("%d". int low. high = n-1.h> # include <conio. &number[i]). int data. &n). data. break.h> main() { int number[25]. else printf("\n Data Not Found "). printf("\n Enter the elements in ascending order: ").1. flag = 0. mid. low. n. scanf("%d". data. scanf("%d". high. A recursive program for binary search: # include <stdio. &data).2. if( low <= high) { mid = (low + high)/2. mid + 1). if(number[mid] == data) { flag = 1. printf("\n Enter the element to be searched: ").1.2.

1. Example: Consider the array x[n] which is stored in memory as shown below: X[0] X[1] X[2] X[3] X[4] X[5] 33 44 22 11 66 55 Suppose we want our array to be stored in ascending order. mid+1. clrscr(). of Information Technology . printf("\n Enter the number of elements: "). We will illustrate this sorting technique by taking a specific example.3. &data). bin_search(a. 3. Then we pass through the array 5 times as described below: Pass 1: (first element is compared with all other elements).. } void main() { int a[25]. } else } printf("\n Element not found"). i < n. The basic idea of bubble sort is to pass through the file sequentially several times. n-1). &n). for(i = 0. Lecture Notes 217 Dept. we compare each element in the file with its successor i. and 4. data. i++) scanf("%d".bin_search(a. i. 0. We compare X[i] and X[i+1] for i = 0. scanf("%d". In each pass. The process is shown below: X[0] X[1] X[2] X[3] X[4] X[5] 33 44 22 11 66 55 22 44 11 44 44 33 22 11 Remarks 44 66 55 66 55 66 The biggest number 66 is moved to (bubbled up) the right most position in the array. } 7.e. data. and interchange X[i] and X[i+1] if X[i] > X[i+1]. data. &a[i]). X[i] with X[i+1] and interchange two element when they are not in proper order. Bubble Sort: The bubble sort is easy to understand and program. 2. printf("\n Enter the elements in ascending order: "). getch(). scanf("%d". n. high). printf("\n Enter the element to be searched: "). Bubble sort is also called as exchange sort.

X[3]. By doing this. we see that we can sort the array of size 6 in 5 passes. For an array of size n. We repeat the same process. Pass 3: (third element is compared).Pass 2: (second element is compared). X[4]. we compare X[i] with X[i+1] for i=0. X[0] X[1] X[2] X[3] 22 11 33 44 11 22 22 11 Remarks 33 22 33 44 33 44 Pass 4: (fourth element is compared). but this time we don’t include X[5] into our comparisons. we will have the smallest number 11 in X[0]. we required (n-1) passes. At this time. we move the fifth biggest number 22 to X[1]. Lecture Notes 218 Dept. X[0] X[1] X[2] 11 22 33 11 22 22 Remarks 33 Pass 5: (fifth element is compared). 2. 1. and X[5]. we move the third biggest number 44 to X[3]. We repeat the process leaving X[2]. and X[5]. By doing this. and 3 and interchange X[i] and X[i+1] if X[i] > X[i+1]. of Information Technology . but this time we leave both X[4] and X[5]. X[4]. We repeat the process leaving X[3]. i. The process is shown below: X[0] X[1] X[2] X[3] X[4] 33 22 11 44 55 22 33 11 33 33 22 Remarks 11 44 33 44 55 44 55 The second biggest number 55 is moved now to X[4]. We repeat the same process. we move the fourth biggest number 33 to X[2].e. By doing this. Thus..

i++) { for (j = 0.3. 7.h> void bubblesort(int x[]. The array is passed through (n-1) times and the smallest element is placed in its respective position in the array as detailed below: Lecture Notes 219 Dept. x[i]). &x[i]). i < n . printf("\n Enter Data:"). of Information Technology . j < n–i-1 . scanf("%d". x[j+1] = temp. which is O(n2). The selection sort algorithm first selects the smallest element in the array x and place it at array position 0. i++) printf ("%5d". } Time Complexity: The bubble sort method of sorting an array of size n requires (n-1) passes and (n-1) comparisons on each pass. x[j] = x[j+1]. } } } } main() { int i. printf("\n Enter the number of elements: "). temp. Selection Sort: Selection sort will not require no more than n-1 interchanges. clrscr(). i < n. bubblesort(x. i < n. Thus the total number of comparisons is (n-1) * (n-1) = n2 – 2n + 1. n. &n).1. n).h> #include <conio.7. j. Therefore bubble sort is very inefficient when there are more elements to sorting. Suppose x is an array of size n stored in memory. j++) { if (x[j] > x[j+1]) { temp = x[j].4. for (i = 0. then it selects the next smallest element in the array x and place it at array position 1. int n) { int i. It simply continues this procedure until it places the biggest element in the last position of the array. printf ("\n Array Elements after sorting: "). i++) scanf("%d". for (i = 0. for(i = 0. x[25]. Program for Bubble Sort: #include <stdio.

. during this pass x[n-1] will be the biggest element and so the entire array is sorted. Example: Let us consider the following example with 9 elements to analyze selection Sort: 1 2 3 4 5 6 7 8 9 Remarks 65 70 75 80 50 60 55 85 45 find the first smallest element j swap a[i] & a[j] 65 find the second smallest element i 45 70 75 80 i 45 50 50 60 55 j 75 80 70 swap a[i] and a[j] 60 55 i 45 50 55 50 55 85 80 70 60 60 75 85 50 55 60 80 65 80 50 55 60 65 70 75 75 75 i 45 45 50 50 Lecture Notes 55 55 60 60 65 65 70 70 Find the fourth smallest element swap a[i] and a[j] 85 85 i 45 65 j 70 Find the third smallest element swap a[i] and a[j] i 45 65 j i 45 85 85 65 Find the fifth smallest element j swap a[i] and a[j] 70 Find the sixth smallest element j swap a[i] and a[j] 80 Find the seventh smallest element j 75 75 swap a[i] and a[j] 85 80 Find the eighth smallest element i J swap a[i] and a[j] 80 85 The outer loop ends. Then x[0]. Pass (n-1): Find the location j of the smaller of the elements x[n-2] and x[n-1]. x[1] are sorted. 220 Dept. of Information Technology . Pass 2: Leave the first element and find the location j of the smallest element in the sub-array x[1]. Then x[0]. x[n-1]. Then x[0] is sorted. its efficiency is also O(n2) for n data items. . and then interchange x[j] with x[0]. . .Pass 1: Find the location j of the smallest element in the array x [0]. x[n-1]. Of course. x[n-2] are sorted. . In spite of superiority of the selection sort over bubble sort and the insertion sort (there is significant decrease in run time). . . . x[3]. x[1]. and then interchange x[j] and x[n-2]. Then x[0]. . and then interchange x[2] with x[j]. . x[n-1]. x[2]. x[2] are sorted. Pass 3: Leave the first two elements and find the location j of the smallest element in the sub-array x[2]. . . . . and then interchange x[1] with x[j]. x[1]. . . Time Complexity: In general we prefer selection sort in case where the insertion sort or the bubble sort requires exclusive swapping. x[1].

scanf("%d".h> #include<conio. a[minindex] = temp. int main() { int num. printf (" Array Elements before sorting: ").1. selectionSort( 0. i<5. &a[i] ).7. j=0. i++ ) { minindex = i. i++ ) printf( "%d ".1 ). for(i=0. int a[25]. selectionSort(int). i< num. Recursive Program for selection sort: #include <stdio. return 0. for (i=0. 11.h> int x[6] = {77. minindex. } void selectionSort( int low. Non-recursive Program for selection sort: # include<stdio. for( i=0. num . &num). i= 0. for( j=i+1. } temp = a[i]. clrscr(). j++ ) { if( a[j] < a[minindex] ) minindex = j. i++) Lecture Notes 221 Dept. clrscr(). j <= high. int high ). } } 7. main() { int i. 66}.4. a[i] ). printf( "\nThe elements after sorting are: " ). for( i=low. 33. a[i] = a[minindex].2.h> void selectionSort( int low. int high ) { int i=0.4. of Information Technology . n = 0.h> # include<conio. 44. printf( "Enter the number of elements: " ). i <= high. i < num. printf( "\nEnter the elements:\n" ). i++) scanf( "%d". temp=0.

x[i]). If down > up. n++ . It is an example of a class of algorithms that work by “divide and conquer” technique. interchange a[down] with a[up] 4. x[p] = temp. and the second group contains those elements greater than or equal to the chosen value. Once the array has been rearranged in this way with respect to the pivot. selectionSort(n). The quick sort algorithm partitions the original array by rearranging it into two groups. Lecture Notes 222 Dept. A. The chosen value is known as the pivot element. i<5. The first group contains those elements less than some arbitrary chosen value taken from the set. When all the subsets have been partitioned and rearranged. Repeatedly increase the pointer ‘up’ until a[up] >= pivot. The function partition() makes use of two pointers up and down which are moved toward each other in the following fashion: 1. for (k = n+1. 2. 3. selectionSort(n). Repeatedly decrease the pointer ‘down’ until a[down] <= pivot. /* interchange x[n] and x[p] */ x[n] = x[p].printf ("%d ". p = k. Hoare in the early 1960’s. } 7. min = x[n]. k<5. i++) printf ("%d ". temp. If ‘up’ pointer crosses ‘down’ pointer. min. Repeat the steps 1. the original array is sorted. if (n== 4) return (-1). 2 and 3 till the ‘up’ pointer crosses the ‘down’ pointer. /* call selection sort */ printf ("\n Array Elements after sorting: "). It was one of the first most efficient sorting algorithms. of Information Technology . p = n. the same partitioning procedure is recursively applied to each of the two subsets. for (i=0. x[i]). the position for pivot is found and place pivot element in ‘down’ pointer position.5. R. } selectionSort( int n) { int k. Quick Sort: The quick sort was invented by Prof. } } temp = x[n]. k++) { if (x[k] <min) { min = x[k]. C. p.

. p) { v = a[m]. do { repeat up = up + 1. return (down). x[j-1] and x[j+1]. up. q+1). So. . if (up < down) then call interchange(a. m. . x[high] between positions j+1 and high. . x[j-1] between positions low and j-1 (where j is returned by the partition function). . . x[high]. This condition will be satisfied only when the array is completely sorted. down = p. The time complexity of quick sort algorithm is of O(n log n). } while (up > down). Then we will have two sub-arrays x[low]. . call quicksort(p. of Information Technology . . It calls itself recursively to sort the left sub-array x[low]. . q). . Here we choose the first element as the ‘pivot’. . . x[low+1].e. pivot = x[low]. x[j+2]. 4. call quicksort(j + 1 . q) { if ( p < q ) then { call j = PARTITION(a. 2. p. . // j is the position of the partitioning element // a[m] is the partition element repeat down = down – 1. a[n + 1] = + ∝ quicksort (p. up = m. Now it calls the partition function to find the proper position j of the element x[low] i. . x[j+2]. a[down] = v. a[m] = a[down]. . The a[n + 1] is considered to be defined and must be greater than all elements in a[n]. . 1. } } partition(a. . pivot. The algorithm of quick sort function sorts all elements in an array ‘a’ between positions ‘low’ and ‘high’. . . . It calls itself recursively to sort the right sub-array x[j+1].The program uses a recursive function quicksort().a[q] which reside in the global array a[n] into ascending order. x[low+1]. . until (a[up] > v). . It terminates when the condition low >= high is satisfied. Algorithm Sorts the elements a[p]. . } Lecture Notes 223 Dept. until (a[down] < v). down). j – 1). . 3.

the elements are swapped. up 16 pivot. If such elements are found. a[up] = a[down]. If ‘up’ pointer crosses ‘down’ pointer. This process continues till the ‘up’ pointer crosses the ‘down’ pointer. of Information Technology . down 02 08 16 06 04) down up 02) 38 (56 down up swap up & down swap pivot & down 57 58 79 70 45) 24 swap pivot & down (08 16 pivot up pivot 04 pivot 04) pivot down (04) swap up & down swap pivot & down up (06 Remarks 06 04) swap up & down down 16 down Up 08 (16) swap pivot & down up swap pivot & down 06 04 pivot. down) { p = a[up].interchange(a. a[down] = p. Let us consider the following example with 13 elements to analyze quick sort: 1 2 3 4 5 6 7 8 9 10 11 12 13 38 08 16 06 79 57 24 56 02 58 04 70 45 pivot up down pivot 04 79 pivot up down pivot 02 57 pivot (24 08 16 06 04 pivot (02 pivot. up (02 04 Lecture Notes 06 08 16 24) 38 224 Dept. down. the position for pivot is found and interchange pivot and element at ‘down’ position. up. Move ‘up’ pointer from left to right in search of an element larger than pivot. Move the ‘down’ pointer from right to left in search of an element smaller than pivot. down. } Example: Select first element as the pivot element.

int partition(int. i++) scanf( "%d". for(i=0. of Information Technology .1. up 02 04 7. &num). down. down. i < num. scanf( "%d". void interchange(int. up (58 56 79 70 45) swap up & down swap pivot & down 79 70 57) swap pivot & down (58 pivot (57) 79 up 57 70 57) swap up & down down 79 down up 58 (70 79) (70 pivot. printf( "\nThe elements after sorting are: " ). int). printf( "Enter the number of elements: " ). 06 08 16 24 38 (45 56 57 58 70 79) 45 56 57 58 70 79 Recursive program for Quick Sort: # include<stdio. down.h> void quicksort(int. down 70 79) swap pivot & down 57 pivot. i = 0. int main() { int num. clrscr(). int). num -1).h> # include<conio.5. up up swap pivot & down 79 pivot.(56 57 58 pivot up down pivot 45 57 pivot down up (45) 45 pivot. &array[i] ). Lecture Notes 225 Dept. int). int array[25]. printf( "Enter the elements: " ). quicksort(0.

pivotpos . of Information Technology . do down = down .for(i=0. while(array[up] < pivot ). if(up < down) interchange(up. i < num. do { do up = up + 1. while(array[down] > pivot). temp = array[i]. quicksort(pivotpos + 1. array[j] = temp. } void quicksort(int low. return 0. void interchange(int i. return down. i++) printf("%d ".1). } } int partition(int low.1. } } while(up < down). quicksort(low. int j) { int temp. down = high. if( low < high ) { pivotpos = partition(low. high). array[down] = pivot. int up = low. } Lecture Notes 226 Dept. int high) { int pivot = array[low]. array[i] = array[j]. high + 1). array[low] = array[down]. array[i]). int high) { int pivotpos. down).

• The right child of an element stored at location i can be found in location 2*i+1.7. Representation of Heap Tree: Since heap is a complete binary tree. • The parent of an element stored at location i can be found at location floor(i/2).2. a heap tree can be efficiently represented using one dimensional array. 95 15 85 75 55 45 25 65 45 35 15 55 85 Max heap 25 65 35 75 Min heap 95 A min heap is an almost complete binary tree such that the value of each node is less than or equal to those in its children. 7. which permits one to insert elements into a set and also to find the largest element efficiently. Heap and Heap Sort: Heap is a data structure. which provides these two operations. The elements of the array can be thought of as lying in a tree structure.6. • The left child of an element stored at location i can be found in location 2*i.6. Priority Queue. A data structure. A heap tree represented using a single array looks as follows: X[1] X[2] X[3] X[4] X[5] X[6] X[7] X[8] 65 45 60 40 25 50 55 30 x[ 1] x[ 2] x[ 4] x[ 8] Lecture Notes 30 65 x[ 3] 60 45 x[ 7] x[ 6] 40 x[ 5] 2 5 50 55 He a p T r e e 227 Dept. of Information Technology . • The root of the tree is in location 1. 7.1. is called a priority queue. Max and Min Heap data structures: A max heap is an almost complete binary tree such that the value of each node is greater than or equal to those in its children. This provides a very convenient way of figuring out where children belong to.6.

The algorithm Max_heap_insert to insert a data into a max heap tree is as follows: Max_heap_insert (a. Insert 40: 40 Lecture Notes 228 Dept. 2. The principle of insertion is that. 35 is added as the right child of 80. Now. } Example: Form a heap using the above algorithm for the data: 40. 70. our process stops here. return true . as 90 is now in root node. Insertion. one can build up a heap tree. item = a[n]. For illustration. Let us consider the heap (max) tree. Using repeated insertions of data. we have to compare it with the data in its parent. This will continue between two nodes on path from the newly inserted node to the root node till we get a parent whose value is greater than its child or we reached the root. parent’s value greater than child’s value is satisfied. when 90 is compared with 40 it requires interchange. another interchange takes place. hence interchange as well as further comparisons are no more required. 45. The path on which these comparisons and interchanges have taken places are shown by dashed line. of Information Technology . 90 is compared with 80. let us consider the case of insertion 90 into the resultant heap tree. 80.6. i = n. Operations on heap tree: The major operations required to be performed on a heap tree: 1. Deletion and 3. Next. Next.7. As another illustration. 50. Its value is compared with its parent’s value. if the value is greater than that at parent then interchange the values. First. // move the parent down i = ⎣ i/2 ⎦ . while ( (i > 1) and (a[ ⎣ i/2 ⎦ ] < item ) do { a[i] = a[ ⎣ i/2 ⎦ ] . Insertion into a heap tree: This operation is used to insert a node into an existing heap tree satisfying the properties of heap tree. starting from an empty heap tree.3. } a[i] = item . 1. 90 will be added as left child of 40. and to be a max heap. Merging. 35. 90. n. first we have to adjoin the data in the complete binary tree. n) { //inserts the value in a[n] into the heap which is stored at a[1] to a[n-1] int i.

35 45 Insert 50: 90 80 40 7. Insert 45: 90 80 40 6. 35 Insert 90: 90 80 80 90 90 40 35 80 35 40 40 90 5.2. 40 Insert 35: 80 40 4. of Information Technology . Insert 80: 80 40 40 80 80 3. 90 50 35 50 45 80 50 35 40 45 35 Insert 70: 90 90 70 80 50 70 80 50 40 Lecture Notes 45 35 70 40 229 45 35 50 Dept.

The algorithm for the above is as follows: delmax (a. they are interchanged. Then re-heap the tree as stated below: • Let newly modified root node be the current node. i. it is in the level 3. a[1] = a[n]. n) // The complete binary trees with roots a(2*i) and a(2*i + 1) are combined with a(i) to form a single heap. 1. // a position for item is found else a[ ⎣ j / 2 ⎦ ] = a[j] // move the larger child up a level j = 2 * j. So. // { j = 2 *i . Now. if the current node is not an empty node. n-1). } Here the root node is 99. • Make X as the current node. The principle of deletion is as follows: • Read the root node into a temporary storage say. } x = a[1]. Compare its value with the value of its two child. while (j < n) do { if ((j < n) and (a (j) < a (j + 1)) then j Å j + 1. As 63 is greater. n. } a [ ⎣ j / 2 ⎦ ] = item. Interchange the value of X with the value of the current node. • Continue re-heap. 1 < i < n. The last node is 26. Next 26 at root node is compared with its two child 45 and 63. item = a[i] . But from the application point of view. No node has an address greater than n or less than 1. of Information Technology . } adjust (a. 99 is replaced by 26 and this node with data 26 is removed from the tree. return true. ITEM. x) // delete the maximum from the heap a[n] and store it in x { if (n = 0) then { write (“heap is empty”). adjust (a. // compare left and right child and let j be the larger child if (item > a (j)) then break. • Replace the root node by the last node in the heap tree. deleting the root node has some special importance. Let X be the child whose value is the largest.Deletion of a node from heap tree: Any node can be deleted from a heap tree. Lecture Notes 230 Dept. return false.

2. say x. 92 59 45 13 92 19 Resultant max heap after merging H1 and H2 Application of heap tree: They are two main applications of heap trees known are: 1. Re-heap H2. Priority queue implementation. hence re-heap is completed. 92 13 59 38 67 19 45 92 H1: max heap 80 93 96 H2: min heap + 96 93 67 80 38 7. Merging the tree H2 with H1 means to include all the node from H2 to H1.26 is compared with its children.6. Merging operation consists of two steps: Continue steps 1 and 2 while H2 is not empty: 1. 26 appears as the leave node. H2 may be min heap or max heap and the resultant tree will be min heap if H1 is min heap else it will be max heap. as 57 is greater.4. namely. Delete the root node. Now. Sorting (Heap sort) and 2. 57 and 42.6. Lecture Notes 231 Dept. 29 12 26 42 24 Af t er De l e t i o n of n o d e w it h d at a 9 9 Merging two heap trees: Consider. so they are interchanged. of Information Technology . Insert the node x into H1 satisfying the property of H1. 26 63 99 26 45 63 57 63 45 57 26 35 27 29 12 24 57 42 35 26 27 De l e t i n g t h e n o d e w it h d at a 9 9 7. two heap trees H1 and H2. from H2.5.

n) // The complete binary trees with roots a(2*i) and a(2*i + 1) are combined with a(i) to form a single heap. { for i Å ⎣ n/2 ⎦ to 1 by – 1 do adjust (a. of Information Technology .7. heapsort(a. No node has an address greater than n or less than 1. 1.7. // compare left and right child and let j be the larger child if (item > a (j)) then break. n) //Readjust the elements in a[n] to form a heap. n) { heapify(a. 3. item = a[i] . adjust (a. } a [ ⎣ j / 2 ⎦ ] = item. for i = n to 2 by – 1 do { temp = a[i]. 2. } Lecture Notes 232 Dept. i. Re-heapify the complete binary tree. First transform the elements into a heap. Continue step 2 until the heap tree is empty. while (j < n) do { if ((j < n) and (a (j) < a (j + 1)) then j Å j + 1. i – 1). n). } } heapify (a. n). // a position for item is found else a[ ⎣ j / 2 ⎦ ] = a[j] // move the larger child up a level j = 2 * j. a[1] = temp. Algorithm: This algorithm sorts the elements a[n]. 1 < i < n. Heap sort rearranges them in-place in nondecreasing order. Remove the top most item (the largest) and replace it with the last element in the heap. HEAP SORT: A heap sort algorithm works by first organizing the data to be sorted into a special type of binary tree called a heap. } adjust (a. i. It does this with the following steps: 1. // { j = 2 *i . Build a heap tree with the given set of data. a. Any kind of data can be sorted either in ascending order or in descending order using heap tree. b. c. Place the deleted node in the output. a[i] = a[1].

Solution: First form a heap tree from the given set of data and then sort by repeated deletion operation: 40 40 80 35 90 45 80 50 70 90 70 45 90 70 45 35 40 40 80 50 50 70 90 35 80 45 50 35 90 70 80 40 Lecture Notes 45 50 35 233 Dept. where ‘k’ is the number of elements in the heap at the time. 70) and sort the data using heap sort. 45. 50. Likewise. 80.Time Complexity: Each ‘n’ insertion operations takes O(log k). so the priority queue sorting algorithm runs in O(n log n) time when we use a heap to implement the priority queue. each such operation runs in O(log n) time in the worst case. for ‘n’ elements it takes O(n log n) time. Since we always have k ≤ n. where ‘k’ is the number of elements in the heap at the time. each of the ‘n’ remove operations also runs in time O(log k). Thus. 90. of Information Technology . Example 1: Form a heap from the set of elements (40. 35.

45 70 80 35 90 50 45 70 80 90 Exchange root 40 with the last element 35 of the array and re-heapify 35 40 50 45 70 80 90 The sorted tree Lecture Notes 234 Dept. 35 70 80 40 90 50 35 70 80 90 Exchange root 45 with the last element 35 of the array and re-heapify 40 35 40 35 40 50 6.1. Exchange root 90 with the last element 35 of the array and re-heapify 80 35 80 45 35 80 70 40 45 45 50 90 40 70 35 50 90 35 2. Exchange root 80 with the last element 50 of the array and re-heapify 70 70 50 45 40 3. 70 70 80 90 40 70 90 35 80 90 Exchange root 50 with the last element 40 of the array and re-heapify 45 40 45 40 45 50 5. 35 80 50 45 40 90 50 35 80 Exchange root 70 with the last element 35 of the array and re-heapify 50 35 50 35 45 50 45 40 4. of Information Technology .

} Lecture Notes 235 Dept. for(i = n. a[i]). j = 2 * i. printf("\n How many element you want: "). while(j <= n) { if((j < n) && (a[j] < a[j+1])) j++. a). int a[]) { int i. a[20]. int n. for(i = n/2. } void heapsort(int n. i++) printf("%5d". int a[]) { int j. getch(). heapify(n. of Information Technology . } } void main() { int i. Program for Heap Sort: void adjust(int i. i--) adjust(i. scanf("%d".7. heapsort(n. printf("\n The sorted elements are: \n").int a[]) { int temp. for (i=1. i++) scanf("%d". else { a[j/2] = a[j]. i > 0. n). i<=n. printf("Enter %d elements: ". item = a[i]. n. } void heapify(int n. i<=n. adjust(1. a). a[1] = temp. a[i] = a[1]. &n). i. for (i=1. item. n. a). &a[i]). a). clrscr().1. i > 0. i--) { temp = a[i].7. i . if(item >= a[j]) break. j = 2*j. } } a[j/2] = item.1.

5 using insertion sort. Sort the sequence 3. 13. 0.8. 3. Write an algorithm to find the total number of elements which are equal to “x” and also indicate the position of the first such element in the array. 9. 9. 6. Lecture Notes 236 Dept. 1. 12. The heap tree can be formed considering the process priority values. 4. Assume that a process having higher priority value will be serviced first. 11. 1. 3. 5. 7. Which of these elements could be the pivot? (There may be more than one possibility!) 8.7. comparisons and exchanges for bubble sort when the number of elements is equal to “10”. 4. 9. 4. Elements associated with their priority values are to be stored in from of heap tree. 4. Assume that the matrix is represented by a two dimensional array. 8. 7. 3. 5. 10. 2. 2. When a “C” function to sort a matrix row-wise and column-wise. 5. say. An array contains “n” elements of numbers. 5. consider the following processes with their priorities: Process P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 Priority 5 4 3 4 5 5 3 2 1 5 These processes enter the system in the order as listed above at time 0. 7. can be represented using an array. 15. into an initially empty binary heap. 14. however. Draw the resulting array after the partition finishes. and 2. Here is an array which has just been partitioned by the first step of quicksort: 3. As heap trees allow the duplicity of data in it. The top priority element that has to be processed first is at the root. and so on. As an illustration. linked list etc. Exercises 1. 6. Which sort would be a better choice: Heap sort or Quick sort? Why? 6. Here is an array of ten integers: 5 3 8 9 1 7 0 2 6 4 Suppose we partition this array using quicksort's partition function and using 5 for the pivot. so it can be deleted and heap can be rebuilt to get the next element to be processed. The order of servicing the process is successive deletion of roots from the heap. Show the result of inserting 10. 8. Write a recursive “C” function to implement binary search and compute its time complexity. Another simplified implementation is possible using heap tree. of Information Technology . The several elements of this array may contain the same number “x”. This implementation is therefore free from the complexities of circular array and linked list but getting the advantages of simplicities of array. 9. 2. Compare these results with the actual number of operations when the given sequence is as follows: 7. 1. Priority queue implementation using heap tree: Priority queue can be implemented using circular array. The program is to be run on a personal computer with limited memory. which can be formed based on their priority values. A very large array of elements is to be sorted. the heap. Find the expected number of passes. 5. 6. 8. one at a time. 2. 4. 9. 6.

n2 [ B ] 7. 879. What is this category? A. so that binary search may be used to locate an entry? A. 42 B. 5. Interchange sorts D. 5 using quick sort with median-of-three partitioning and a cutoff of 3. Sort 3. 41 D. Which searching can be performed iteratively ? A. n . 434. Constant time C. B. none [ B ] 6. 11. 1 D. Logarithmic time B. 111. What additional requirement is placed on an array. 65. Binary search B. 572. Each component of the array requires a large amount of memory B. How many items are now guaranteed to be in their final spot (never to be moved again)? A. Constant time C. n log n B. Average time is quadratic [ B ] 8. 9. both D. linear search C. 4. 1. 811. 543. Show how heap sort processes the input 142. both D. Which searching can be performed recursively ? A. 5. 6. Linear time [ D ] 2. [ C ] 4. how many times is the swap function called in the complete execution of the algorithm? C. Suppose that a selection sort of 100 items has completed 42 iterations of the main loop. 102. 3. Binary search B. What is the worst-case time for binary search finding a single item in an array? A.10. The array elements must form a heap. When is insertion sort a good choice for sorting an array? A. Each component of the array requires a small amount of memory D. The array has only a few items out of place C. The processor speed is fast [ B ] Lecture Notes 237 B ] Dept. Logarithmic time B. of Information Technology . Linear time [ B ] 3. 43 [ C ] 9. Selection sort and quick sort both fall into the same category of sorting algorithms. 242. 123. 2. D. Multiple Choice Questions 1. 453.1 A. linear search C. The array must be sorted. 21 C. Quadratic time D. 1. In a selection sort of n elements. O(n log n) sorts C. The array's size must be a power of two. Divide-and-conquer sorts B. Quadratic time D. What is the worst-case time for serial search finding a single item in an array? A. The array must have at least 2 entries C. none [ 5.

D. but it is not the 9. The pivot could be the 7. none [ C ] 21. O(n²) [ 13. and we have just finished one of the reheapifications downward. heap sort D. In which searching technique elements are eliminated by half in each pass . B. O(n) A. any where [B ] 16. O(n log n) B. 2 B. bubble sort [ D ] 18. O(n²) [D ] 11. O(log n) C. Heap sort C. C. A. Suppose we are sorting an array of eight integers using heap sort. log2 n B. The array now looks like this: 6 4 5 1 2 7 8 How many reheapifications downward have been performed so far? A. but it could be the 9. greedy D. Neither the 7 nor the 9 is the pivot [ A ] 12. What is the worst-case time for heap sort to sort an array of n elements? A. O(log n) C. root D. n [ A ] 15. both D. median of list B. What is the worst-case time for quick sort to sort an array of n elements? A. 3 or 4 D. merge sort B. Running time of Heap sort algorithm is -----. Quick sort is also known as A. C. O( log2 n) B. Binary search B. n log2n A. The pivot could be either the 7 or the 9. O(n) D. Linear search C. O(n) D. none 238 C ] Dept. A min heap is the tree structure where smallest element is available at the A. Time complexity of inserting an element to a heap of n elements is of the order of C. O( n log2 n) D. intermediate parent B. Which design algorithm technique is used for quick sort . dynamic programming [ A ] 19. In the quick sort method . and we have just finished the first partitioning with the array looking like this: 2 5 1 7 9 12 11 10 Which statement is correct? A. of Information Technology . backtrack B. Which among the following is fastest sorting technique (for unordered data) A. 5 or 6 [B ] 14. O(n log n) B. first element of list C. n2 D. A. any element of list [C ] 17. O(n2) [ B ] Lecture Notes C. Suppose we are sorting an array of eight integers using quick sort. Quick Sort B. Bubble sort [ C ] 20. The pivot is not the 7. A. Divide and conqueror C. leaf C. Selection Sort D. last element of list D.10. 1 C. a desirable choice for the portioning element will be A.

Time complexity of insertion sort algorithm in best case is C. A. O(n) B.22. 13 B.22.19. Quick sort D. O( log2 n) B. O( log2 n) C. Deque D. Binary Search Tree [ Lecture Notes C.55 is A. The number of swappings needed to sort the numbers 8.10. 14 [ D ] 26. O( log2 n) C. 60. A. none C ] D ] A ] C. Running time of Bubble sort algorithm is -----. O( n log2 n) D. Running time of Selection sort algorithm is -----. O( n log2 n) D. both D.30.60.15 C. priority Queue C.10. Binary search algorithm performs efficiently on a A. A.5. A. of Information Technology . O(n2) [ C ] 27. O(n2) [ D ] 23.7. Selection Sort [ 29. none [ A 30. A.9.10.55. none 239 ] Dept.10.80. Bubble sort B. none [C ] 28. 11 C. linear queue B. Always Heap is a A.55. linked list C. O(n) A.31. 80.15. none [ 25. The Max heap constructed from the list of numbers 30. O(n) B.15.60. O(n2) [D ] 24.55. complete Binary tree B.30.15 D.13 in ascending order using bubble sort is A.80. 80.60. Heap is a good data structure to implement A.30 B. 12 D. O( n log2 n) D. Full Binary tree D. array B. Which is a stable sort ? A.