What is the worst-case scenario for the binary search for finding a single item in an sorted array?

What is the maximum depth of recursive calls a function may make?

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?

A binary search tree is generated by inserting the following integers in the order: 50,15,62,5,20,58,91,3,8,37,60,24. How many nodes are in the left and right subtrees, respectively?

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?

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?