(c) does not evaluate correctly and should be replaced by (4 > y & y > 1)
(d) does not evaluate correctly and should be replaced by (4 > y || y > 1)
Which of the following statements about binary search trees is false?
a) The binary search tree facilitates duplicate elimination.
b) In a tightly packed binary search tree, each level contains about half as many
elements as the previous level. (The previous level is the level closer to the root node.)
c) When searching a tightly packed billion-element search tree, only about 30 elements
(or fewer) are required to locate most elements.
d) When searching a tightly packed million-element search tree, only about 20 elements
(or fewer) are required to locate most elements.
Q2: Which statement about class unique_ptr (of the new C++ standard) and dynamic
memory allocation is false?
a. An object of class unique_ptr maintains a pointer to dynamically allocated memory.
b. When a unique_ptr object destructor is called (for example, when a unique_ptr object
goes out of scope), it performs a destroy operation on its pointer data member.
c. Class template unique_ptr provides overloaded operators * and -> so that a
unique_ptr object can be used just as a regular pointer variable is.