Consider this binary search tree.

This question is based upon the figure shown below

Consider this binary search tree.

Which will be the new root if you remove the root and replace it with something from the left subtree?

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?

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

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

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?

A binary tree, all the levels of which except possibly the last have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as:

Which of these are standard operations of Stack Data Structure?

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

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

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 will happen if in data structure a pop operation on the stack causes the stack pointer to move past the origin of the stack?