THE education site for computer science and ICT
3. Binary Trees
Trees can come in all shapes and sizes. But for Huffman encoding, you need a particular shape of tree called a binary tree.
Binary trees limit the number of branches each node can have.
- Parent nodes can only have a maximum of two child nodes
- Child nodes can only have one parent node
The resulting binary tree will always look something like this:
Challenge see if you can find out one extra fact on this topic that we haven't already told you
Click on this link: What is a binary tree