Java programming

Question 5

When working with BSTs, inorder traversals are popular as they yield sorted order, lowest to highest value.

Group of answer choices

True

False

Question 6

Which of these statements are true about a standard TreeMap?

Group of answer choices

they have two generics (type parameters)

as with all maps, they map Keys to Values

their generics are often called K (for "key") and V (for "value")

since they are implemented with a BST, they automatically maintain ordering

they can be used to implement an Index concept, where Values are always integers

Question 7

The more a tree is out of height balance, the more the search algorithm moves from...

Group of answer choices

O(n) to O(n^2)

O(n) to O(log n)

O(log n) to O(n)

O(log n) to O(n log n)

Question 8

Two common balancing approaches are periodic rebalancing and continuous rebalancing.

Group of answer choices

True

False

Question 9

In a UML Class Diagram, aggregation means the child cannot exist independently of the parent

Group of answer choices

True

False

Question 10

One typical approach for periodic rebalancing is to create a new, empty tree, then create a sorted array by doing an inorder traversal, then splitting the array in half, taking the middle element and adding it to the new tree, then recursing to process the rest of the array.

Group of answer choices

True

False