1.A ____ is a list in which each element contains a key, such that the key in the element at position k in the list is at least as large as the key in the element at position 2k + 1 (if it exists) and 2k + 2 (if it exists).
2.A linked list is a collection of ____.
3.The structured design approach is also known as ____.
4.Operations, such as finding the height, determining the number of nodes, checking whether the tree is empty, tree traversal, and so on, on AVL trees cannot be implemented the same way they are implemented on binary trees.
5.____ iterators are forward iterators that can also iterate backward over the elements.
6.A list is ordered if its elements are ordered according to some criteria.
7.The analysis of algorithms enables programmers to decide which algorithm to use for a specific application.
8.The number of key comparisons in a sequential search depends on the value of the search item.
9.A precondition is a statement specifying the condition(s) that must be true before the function is called.
10.The header node is placed at the ____ of a list.
11.The copy constructor automatically executes when, as a parameter, an object is passed by value.
12.When the destructor ____ the queue, it deallocates the memory occupied by the elements of the queue.
13.The expression vecList.front() moves an element to the front of the vector.
14.We can traverse a singly linked list backward starting from the last node.
15.When you declare a derived class object, this object inherits the members of the base class, but the derived class object cannot directly access the ____.
16.The expression vecCont.empty() empties the vector container of all elements.
17.The components of a class are called the ____ of the class.
18.In a doubly linked list, some of the operations require modification from how they were implemented for a regular linked list, because of the ____ pointer(s) in each node.
19.The syntax for accessing a class (struct) member using the operator -> is ____.
20.If the list is stored in an array, we can traverse the list in either direction using an ____.
21.With the help of the ____, two values can be combined into a single unit and, therefore, can be treated as one unit.
22.The deque class is a type of container adapter.
23.The operation ____ reinitializes the stack to an empty state.
24.In the random probing method, the ith slot in the probe sequence is ____.
25.The binary search algorithm uses the ____ technique to search the list.
26.To define new classes, you create new ____ files.
27.To remove, or pop, an element from the stack ____.
28.Every call to a recursive function requires the system to allocate memory for the local variables and formal parameters
29.A technique in which one system models the behavior of another system is called ____.
30.Because a queue is an important data structure, the Standard Template Library (STL) provides a class to implement queues in a program.
31.The derived class can redefine public member functions of a base class.
32.Containers are class templates.
33.Containers are essentially used ____.
34.In breadth first traversal, starting at the first vertex, the graph is traversed as little as possible.
35.If the list is stored in a linked list, we can traverse the list in only one direction starting at the first node because the links are only in one direction.
36.Default arguments can be used with an overloaded operator.
37.In a shallow copy, two pointers of different data types point to the same memory.
38.In a ____, customers or jobs with higher priority are pushed to the front of the queue.
39.The statement vecList.push_back(elem) deletes the element elem from the vector.
40.The use of a queue structure ensures that the items are processed in the order they are received.