Java Programming

D Question 1 0.1 pts To determine a tree's height, count the nodes from the root to the farthest leaf node. O True O False Question 2 0.1 pts An internal node is a node that has at least one child. O True O False Question 3 0.1 pts Which statements are true about binary search trees? they are binary trees whose nodes have at most two children the left subtree's elements have values that are greater than the value of the parent node they maintain a root reference they are considered "height balanced" if the count of nodes on the left is within one of the count of nodes on the right Question 4 0.1 pts Describe the typical traversal orders for binary trees, using one of these words: preorder, inorder, postorder Process the left subtree, then the root, then the right subtree Process the left subtree, then the right subtree, then the root Process the root, then the left subtree, then the right subtree D Question 5 0.1 pts When working with BSTs, inorder traversals are popular as they yield sorted order, lowest to highest value. O True O False U Question 6 0.1 pts Which of these statements are true about a standard TreeMap? 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 n Question 7 0.1 pts The more a tree is out of height balance, the more the search algorithm moves from... O O(n) to O(n^2) O O(n) to O(log n) O O(log n) to O(n) O O(log n) to O(n log n) V Question 8 0.1 pts Two common balancing approaches are periodic rebalancing and continuous rebalancing. O True O False Question 9 0.1 pts In a UML Class Diagram, aggregation means the child cannot exist independently of the parent O True False Question 10 0.1 pts 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. o True O False