Since 2014, the HashMap in Java has used one type of these data structures once the hash bucket, and thus the probability of hash collisions, is sufficiently large. For 10 points each:
[10e] Name this data structure with a single root node and leaf nodes which are each connected to exactly one parent node.
ANSWER: tree [accept, BUT DO NOT REVEAL, binary search tree or specific types of trees]
[10m] In trees described by this two-word phrase, nodes with keys less than the current node are stored in the left subtree. An algorithm named by this phrase progressively eliminates half of an array until the target result is found.
ANSWER: binary search [accept binary search tree]
[10h] AVL and red-black binary search trees also have the “self-” form of this property, meaning they rearrange themselves to minimize height. The worst-case time complexity for lookup operations in trees with this property is O (log n).
ANSWER: balanced [accept self-balancing]
<Science - Other Science>