Pregunta de entrevista de Happiest Minds Technologies
Implement stack using linked list. Implement binary search tree.
Respuesta de la entrevista
Anónimo
12 de ago de 2016
Stack is Last in First out. For push operation insert the node at end and for pop() delete the node from front.