Heapable Sequences and Subsequences

John Byers, Brent Heeringa, Michael Mitzenmacher +1

Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at…