Optimal skeleton and reduced Huffman trees

Shmuel T. Klein, Jakub Radoszewski, Tamar C. Serebro, Dana Shapira

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


A skeleton Huffman tree is a Huffman tree from which all full subtrees of depth h≥1 have been pruned. Skeleton Huffman trees are used to save storage and enhance processing time in several applications such as decoding, compressed pattern matching and wavelet trees for random access. A reduced skeleton tree prunes the skeleton Huffman tree further to an even smaller tree. The resulting more compact trees can be used to further enhance the time and space complexities of the corresponding algorithms. However, it is shown that the straightforward ways of basing the constructions of a skeleton tree as well as that of a reduced skeleton tree on a canonical Huffman tree do not necessarily yield the least number of nodes. New algorithms for achieving such trees are given.

Original languageEnglish
Pages (from-to)157-171
Number of pages15
JournalTheoretical Computer Science
StatePublished - 8 Jan 2021


  • Data compression
  • Huffman tree
  • Reduced skeleton
  • Skeleton tree


Dive into the research topics of 'Optimal skeleton and reduced Huffman trees'. Together they form a unique fingerprint.

Cite this