D 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 Question 5 0.1 pts When working with BSTs, inorder traversals are popular as they yield sorted order, lowest to highest value True False 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 Vitor "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