Answer the following statements true (T) or false (F)
1) A binary search tree is always a full tree.
2) Finding an element in a binary search tree always requires O(log 2 n) comparisons.
3) In a binary search tree, a new element is always added as a leaf.
4) In a balanced binary search tree, adding an element always requires approximately O(log 2 n) steps.
5) In a binary search tree, the elements in the right subtree of the root are always larger than the element stored at the root.
1) F
2) F
3) T
4) T
5) F
You might also like to view...
Which of the following will properly encode the string "\w\\\t" into variable s?
a) s = \w\\\t''; b) s = ;(\w\\\t) c) s = \w\\\\\\ d) s = /w///
A cross between human language and a programming language is called
a. a compiler b. pseudocode c. the Java Virtual Machine d. the Java language
A(n) ____________________ is a special routine containing instructions for handling interrupts.
Fill in the blank(s) with the appropriate word(s).
The goal of network performance optimization is to keep resources available and the network performing as fast as expected.
Answer the following statement true (T) or false (F)