Skip to contentSkip to footer
      employer cover photo
      employer logo
      employer logo

      Happiest Minds Technologies

      Engaged Employer

      Happiest Minds Technologies Technical Lead interview

      Happiest Minds Technologies Interview Question

      Technical Lead Interview

      Implement stack using linked list. Implement binary search tree.

      Interview Answer

      Anonymous

      Aug 12, 2016

      Stack is Last in First out. For push operation insert the node at end and for pop() delete the node from front.

      Related searches: Happiest Minds Technologies reviews | Happiest Minds Technologies jobs | Happiest Minds Technologies salaries | Happiest Minds Technologies benefits
      Happiest Minds Technologies interviews