Domanda di colloquio di Happiest Minds Technologies
Implement stack using linked list. Implement binary search tree.
Risposta di colloquio
Anonimo
12 ago 2016
Stack is Last in First out. For push operation insert the node at end and for pop() delete the node from front.