Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The d-ary heap or d-heap is a generalization of the binary heap data structure whose non-leaf nodes have d children, instead of 2. Thus, a binary heap is a 2-heap. According to Jensen et al, d-ary heaps were invented by Johnson in 1975. 4-heaps may perform better than binary heaps in practice. A d-ary heap typically runs much faster than a binary heap in a virtual environment. A binary heap typically requires more VM page faults than a d-ary heap, each one taking far more time than the "extra" comparisons a d-ary heap makes compared to a binary heap.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.