Yes it is possible to implement stack and queue using linked list
There is no inherent relationship between the two. It's possible to implement a stack using an array to store date, but that's about it.
Explain The merits of using a deque to implement a stack in data structure
Heap is a data-structure, it cannot implement anything. On the other hand, it is true that: 1. Recursive routines might use heap. 2. You can use dynamic memory allocation (heap), to implement a stack; and use the stack to implement recursion.
Stack implementations allow us to easily implement backtracking algorithms.
Stacks are primarily used to implement backtracking algorithms.
stack abstract datatype
Stack is not a way to perform quicksort, it is a tool used to implement recursion.
I didnt get exactly what do you mean by stack class template, but this is one which implements a stack! and also shows how to implement it with templates http://thetechnofreaks.com/2011/10/26/4-creating-a-stack/#ixzz1bvq2V1Ws
Sure, recursion can always be substituted with using a stack.
linked list are used for creation of stack,queues to use memory in optimum manner linked list are used as they are dynamic in nature
This is not possible as this violates the basic definition of stack...That can have only two primitive operations "Push" "POP" If u want to implement what u want u can do that by some implementation of Push pop combination but that is what other data strutures like queue do....
Stacks are often implemented using the same node structure as a linked list.