Data Structures Programs

::

Data Structures Programs Using C++ ::

LIST OF PROGRAMS 1)

STACKS USING ARRAYS

2)

STACKS USING LINKED LISTS

3)

QUEUES USING LINKED LISTS

4)

CIRCULAR QUEUES USING ARRAYS

5)

CIRCULAR QUEUES USING LINKED LISTS

6)

DEQUEUES USING DOUBLE LINKED LISTS

7)

EVALUATION OF POSTFIX EXPRESSION

8)

CONVERSION OF INFIX TO POSTFIX

9)

ADDITION & SUBTRACTION OF 2 SPARSE MATRICES

10)

BINARY TREE TRAVERSALS USING RECURSION

11)

BINARY SEARCH TREE OPERATIONS

12)

POLYNOMIAL ADDITION & MULTIPLICATION

13)

HEAP SORT

14)

MERGE SORT

15)

INSERTION SORT

16)

BUBBLE SORT

17)

SELECTION SORT

18)

BINARY SEARCH

19)

LINEAR SEARCH

20)

QUICK SORT

21)

BREADTH FIRST SEARCH

22)

DEPTH FIRST SEARCH

23)

CONVERSION OF INFIX TO PREFIX

24)

REVERSING A LINKED LIST

25)

LINKED LIST CREATED IN ASCENDING ORDER

26)

PARANTHESIS MATCHING

27)

TOWERS OF HANOI

28)

USAGE OF DIFFERENT PARAMETERS

29)

QUEUES USING ARRAYS

30)

COMBINING TWO LINKED LISTS

K S V KRISHNA SRIKANTH

Page 1

1)

Stacks using arrays

#include #include #include template class stack { T *s; int top,size; public: stack(int); ~stack(); void push(); void pop(); void display(); }; template stack::stack(int k) { size=k; s=new T[size]; top=0; } template stack::~stack() { delete s; } template void stack::push() { if(top==size) cout