Thread Tree View: comp.compression.research
2 messages
Depth: 1
Cached
Build time: 995.34µsms
| 2 messages | Max depth: 1
Thread Tree
2 nodes
max depth: 1
1 leaves
Root Message
how Huffman tree can be stored efficiently ?
From: Jerzy Tarasiuk
Date: Wed, 30 Sep 1992 17:48
Article: 83
Message-ID: <JT.92Sep30184832@fizyk1.fuw.edu.pl>
Debug Information
Tree Statistics
- Root Article: 83
- Message Count: 2
- Max Depth: 1
- Cache Hit: Yes
- Build Time: 995.34µs
Thread Root
- Subject: how Huffman tree can be stored efficiently ?
- From: Jerzy Tarasiuk
- Date: Wed, 30 Sep 1992 17:48
- Article: 83