Just as binomial heaps are based on the binary number system, skew binary heaps are based on the skew binary number system.

One possible implementation is a skew binary random access list using the skew binary number system, which involves a list of trees with special properties; this allows worst-case constant time head/cons operations, and worst-case logarithmic time random access to an element by index).

Just as binomial heaps are based on the binary number system, skew binary heaps are based on the skew binary number system.

One possible implementation is a skew binary random access list using the skew binary number system, which involves a list of trees with special properties; this allows worst-case constant time head/cons operations, and worst-case logarithmic time random access to an element by index).