Given that we need to store N nodes in a binary tree, the maximum height, Hmax, is _____.
A. Hmax = N
B. Hmax = N - 1
C. Hmax = ÖN
D. Hmax = N/2
Answer: A
You might also like to view...
When the number of repetitions are known in advance, you should use a ___________ statement.
a. while b. do…while c. for d. None of the above
Using the Python interactive shell, put the elements of the list you instantiated in exercise 3 in alphabetical order.
What will be an ideal response?
What is wrong with the following member function definition given the class below?
class Rational { public: Rational(); Rational(int numer, int denom); Rational(int whole); int getNumerator() const; int getDenominator() const; friend void display(ostream& out, const Rational& value); private: int numerator; int denominator; }; int Rational::getNumerator() const { numerator = 0; return numerator; } a. You can not set the numerator to zero b. The function may not modify numerator, but it can modify denominator c. The function may not modify any of the private data members d. nothing e. A and B f. A and C
Trace statements do not add any notable size to your code.
Answer the following statement true (T) or false (F)