Edited by Peter Ljunglöf, Alex Gerdes, Jonas Almström Duregård. The index labels these three people as editors; no separate chapter author is identified.
The inspected online edition is undated. The displayed 2016–2026 range has no stated date role and is not taken as a publication year.
Cited passages: Data Structures and Algorithms, section 9.1.1: complete shape and binary heap example; Data Structures and Algorithms, section 9.1.1: full shape and Huffman coding tree example; Data Structures and Algorithms, section 9.1.1: perfect shape, equal leaf levels, and Figure 9.4; Data Structures and Algorithms, section 9.1.2, height pseudocode: null returns -1.
Articles by others on the same topic
There are currently no matching articles.