Happiest Minds Technologies interview question
Implement stack using linked list. Implement binary search tree.
Interview Answer
Anonymous
12 Aug 2016
Stack is Last in First out. For push operation insert the node at end and for pop() delete the node from front.