Question
This type of abstract data type can be traversed using pre-order, in-order, and post-order methods. For 10 points each:
[10e] Name this data structure whose top node is called a root. The “binary” form of these data structures can have nodes with at most two children.
ANSWER: binary trees
[10m] In binary trees, this task has an average runtime of big O of log n. A hash filters out positions of text while remaining characters are string matched to perform this task in the Rabin-Karp algorithm.
ANSWER: searching
[10h] Many chess engines use this searching framework along with the Alpha-Beta algorithm for evaluation. This search algorithm avoids infinite loops by using depth limits and is extremely efficient in conditions where the depth is unknown.
ANSWER: iterative deepening
<YM, Other Science>
Summary
| 2023 ILLIAC (Mainsite) | 2023-10-21 | Y | 1 | 20.00 | 100% | 100% | 0% |
Data
| WUSTL | Missouri | 10 | 10 | 0 | 20 |