Which of the following is always true when adding an element to a heap?
a) The new element will always be a leaf.
b) The new element will always be the root.
c) The new element will always be an internal node.
d) The new element will always have 2 children.
e) none of the above is always true
e) none of the above is always true
You might also like to view...
Which statement is false?
a. In a tightly packed binary tree, each level contains about twice as many elements as the previous level. b. When searching a tightly packed 1,000,000-element binary search tree, approximately 20 comparisons need to be made. c. The level-order traversal of a binary tree visits the nodes of the tree row-by-row starting at the root node level. d. Searching a binary tree for a value that matches a key value is slow for loosely packed trees.
____________________ is the ability to combine different design elements into a cohesive whole.
Fill in the blank(s) with the appropriate word(s).
A ________ is a symbol used to set off items in a list
Fill in the blank(s) with correct word
A frameset is always composed of multiple files. There must be one file that defines the frameset and ____ additional files that define the frames within that frameset.
A. one or more B. two or more C. three or more D. four or more