1. ## Binary Tree Crypto

this is a rather interesting assignment i have, and i have no clue where to start with it.

my instructor gave us a header for a binary tree that accepts and sorts strings. we must use it to take a single word (such as a name) , break it into its component letters and numbers, and insert them into a tree. then we must assaign each letter a 'path' meaning, it converts each letter into a number based upon the direction it had to move down the tree to get to that letter. for example, moving left would be '0', and moving right would be '1', then hold would be '2'.

basically, i have no idea where to even start, i just want to get an idea what others would do so that i can use that as a jump off point.

2. And we're supposed to extrapolate the answer to your question when all you've given us is a snippet of the information you have to hand?
Like for example, what tree routines do you have available

> i have no idea where to even start
Breaking words into letters and adding them to a tree would show us (and you) something at least

> based upon the direction it had to move down the tree
So say 'q' would be "01001101" as a series of left/right branches
Build a tree, then print some paths

3. Also, google for huffman compression.

4. Yeah, this sounds like the Huffman encoding scheme; thus, your subject title is a misnomer. Huffman encoding is used for data compression, not cryptography. It's still wicked cool, though.

5. >Huffman encoding is used for data compression, not cryptography.
Compression algorithms can often be used as simple encryption.