Task: Text Categorization
Input (English): The dancing variety, employed in the Reiser4 file system, delays optimization until a flush-to-disk command is issued. One variety of them, invented by Sleator and Tarjan, rearranges the entire structure without storing any bookkeeping work, and is known as the splay type, but it lacks the worst-case guarantee of O(log n) [big O of log n] run-time present in the AVL type. The B variety may have a variable number of keys, and the one named after Arne and Andersson is a specific case of the red-black variety, which employs a balancing algorithm that checks the color of each of its nodes. All children to the left of a root are less than those at the root in the binary-search type of, FTP, which type of data structure whose nodes at the bottommost level are called leaves
Output (English): Science