What will happen if in data structure a pop operation on the stack causes the stack pointer to move past the origin of the stack?

If h is the depth of the tree, which formula will be used to find the maximum number of nodes n in a perfect binary tree?

What is the minimum number of edges and vertices possible in a non- planar graph?

Which of the following is the worst-case scenario for operations on heaps?

Which of these are standard operations of Stack Data Structure?

Suppose we have a circular array implementation of a queue, with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42. Where does the enqueue member function place the new entry in the array?

What do we call a binary tree in which all the levels, except possibly the last level, have the maximum number of nodes, and in which all the nodes at the last level appear as far left as possible?

Which formula is the best approximation for the depth of a heap with n nodes?

The number of distinct simple graphs with up to three nodes is _______.

You have implemented a queue with a linked list keeping track of a front pointer and a rear pointer. Which of these pointers will you change during an insertion in the middle of a NONEMPTY queue?