1. C++ program to implement stack using arrays.
2. C++ program to implement stack using linked list.
3. C++ program to convert infix expression to postfix.
4. C++ program to convert infix expression to prefix.
5. C++ program to implement simple queue.
6. C++ program to implement priority queue.
7. C++ program to implement circular queue.
8. C++ program to implement single linked list.
a) Inserting a node at the beginning
b) Inserting a node at the end
c) Inserting a node at the given position
d) Deleting a node at the beginning
e) Deleting a node at the end
f) Deleting a node at the given position
9. C++ program to implement double linked list.
10. C++ program to implement binary search.
11. C++ program to construct binary tree and traverse traversal
a) inorder,
b) preorder,
c) post order.
12. C++ program to implement sorting techniques.
a) Bubble sort
b) Merge sort
c) Selection sort
d) Quick sort
e) Simple insertion sort
f) Heap sort
g) Binary tree sort
Part A:
C++ program to implement sorting techniques.
1. Bubble sort
2. Merge sort
3. Selection sort
4. Quick sort
5. Simple insertion sort
6. Heap sort
7. Binary tree sort
8. C++ program to implement binary search.
Part B :
1. C++ program to implement stack using arrays.
2. C++ program to implement stack using linked list.
3. C++ program to implement simple queue using arrays.
4. C++ program to implement simple queue using linked list.
5. C++ program to implement circular queue using arrays.
6. C++ program to implement circular queue using linked list.
Part C:
1. C++ program to construct binary tree and traverse traversal
a) inorder
b) preorder
c) post order
2. C++ program to convert infix expression to postfix.
3. Write a C++ program that uses functions to perform the following:
a) Create a binary search tree of integers.
b) Search for an integer key in the above binary search tree