Q: In this task you will be given a text passage from a trivia quiz. You should choose the category this question belongs to from these categories: History, Science, Social Science, Fine Arts, Literature. You can only choose one category, so if in doubt, please choose the closest match.
Takoka developed one version of this data structure called the 2-3 variety, while other versions of this structure include the skew and leftist varieties. Tarjans algorithm can be used to construct them in linear time, and Dijkstras algorithm often uses the Fibonacci type. This structures namesake sorting algorithm has a worst-case runtime of big O of n log n, and operations allowed within these structures include delete-max and merge. FTP, name these data structures used to implement priority queues, that consist of a tree in which each child node has a key less than that of the parent node.
A:
Science