Packet 3: Tossup 3

Graphs named in analogy to these objects are used to visualize hierarchical clustering. Bootstrap aggregating of these structures is used in a machine learning method named for “random” places where they’re abundant. (15[1])For a weighted undirected graph, Prim’s algorithm finds a (*) “minimum (10[1])spanning” structure (10[1])named for these objects. (10[1])These objects name a structure that, if balanced, can be searched in logarithmic (10[1])type. (10[1])Types of a structure named for these objects include AVL, red-black, and a binary search type. For 10 points, a branching data structure named for what objects may have “root nodes” and “leaves?” ■END■

Back to tossups

Buzzes

Summary