Step 1: Heaps require the property of sorting themselves such that the smallest or largest element is at the top. So we need something that can sort itself in reasonable time complexity every-time a new element is added or deleted. A good way to get that is a binary search tree which can do this in O(log n).

Either use scope-resolution operator or virtual functions

A destructor is a member function that is invoked automatically when the object goes out of scope or is explicitly destroyed by a call to delete . A destructor has the same name as the class, preceded by a tilde ( ~ ). For example, the destructor for class String is declared: ~String()

Sorted it using recursion, wherein the current element (top) is taken out and the function called by recursion to sort the remaining stack. Then the element is inserted in its right place.

Tip 1 : Know all about your project.
Tip 2 : Abide by organisation norms while making a system

Tip 1 : Be goal-oriented and see yourself at the finish-line, at the point when you have already completed the job.

Tip 1 : Be ready for such questions before-hand and keep answers and situation examples ready.

Tip 1 : Read well about the company.

Tip 1 : As a self-sufficient, independent person who has grown personally and professionally.