Question

The memory required by these data structures can be reduced by storing only the bitwise XOR of two opposite values. Hitotumata (0[1])and Noshita introduced a technique to manipulate these structures that Donald Knuth ("kuh-NOOTH") popularized as "dancing." In hash tables, separate chaining typically uses these structures to (20[1])store colliding keys. The roots of a (*) Fibonacci heap are placed into a "circular" one of these structures. These (10[2]0[1])structures feature constant-time insertion without shifting and can be reversed by iterating over "current," "previous," and "next" values for the pointers that connect their nodes either (10[3])"singly" or (0[1])"doubly." For (0[1])10 points, name these linear data structures that are often conflated with arrays. ■END■ (10[1]0[3])

Back to tossups

Buzzes

Summary