From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,682788b945fa0bec
X-Google-Attributes: gid103376,public
From: Ehud Lamm <mslamm@mscc.huji.ac.il>
Subject: Re: Technique Question!
Date: 1999/04/03
Message-ID: 
 <Pine.A41.3.96-heb-2.07.990403174521.107932A-100000@pluto.mscc.huji.ac.il>#1/1
X-Deja-AN: 462398024
References: <3705A728.97751843@bellatlantic.net>
Content-Type: TEXT/PLAIN; charset=US-ASCII
Organization: The hebrew University of Jerusalem
Mime-Version: 1.0
Newsgroups: comp.lang.ada
Date: 1999-04-03T00:00:00+00:00
List-Id: <comp.lang.ada>

Heap?

Ehud Lamm     mslamm@pluto.mscc.huji.ac.il

On Sat, 3 Apr 1999, Mark wrote:

> I'm a student, taking a Data Structures course.  I'm currently writing a
> program that produces Huffman Encoding for text input.  I'm trying to
> determine the best data structure to utilize for sorting the character
> frequencies.  I used a linked-list of records to store 1)character,
> 2)frequency, and 3) marked/unmarked.  (with the linked-list sorted
> according to character)  From here I intended to populate the binary
> tree, but must first sort according to frequency.  I feel that there
> must be a cleaner alternative.  Has anyone done this, and if so what did
> you find to be the best approach?
> 
> 
>