[Scheduler] Store Tasks on a Min Binary Heap

Switches Scheduler's priority queue implementation (for both tasks and
timers) to an array-based min binary heap.

This replaces the naive linked-list implementation that was left over
from the queue we once used to schedule React roots. A list was arguably
fine when it was only used for roots, since the total number of roots is
usually small, and is only 1 in the common case of a single-page app.

Since Scheduler is now used for many types of JavaScript tasks (e.g.
including timers), the total number of tasks can be much larger.

Binary heaps are the standard way to implement priority queues.
Insertion is O(1) in the average case (append to the end) and O(log n)
in the worst. Deletion is O(log n). Peek is O(1).

Author: acdlite

packages/react-dom/src/events/SimpleEventPlugin.js

@@ -190,6 +190,7 @@ for (let i = 0; i < eventTuples.length; i++) {
 
   const config = {
     phasedRegistrationNames: {
+      DOMTopLevelEventTypes,
       bubbled: onEvent,
       captured: onEvent + 'Capture',
     },