# Data structure - What is the Huffman algorithm?

## What is the Huffman algorithm?

- In Huffman Algorithm, a set of nodes assigned with values is fed to the algorithm.

- Initially 2 nodes are considered and their sum forms their parent node.

- When a new element is considered, it can be added to the tree.

- Its value and the previously calculated sum of the tree are used to form the new node which in turn becomes their parent.

- This algorithm is based on the frequency of occurrence of a data item.

- It uses a specific method for choosing the representation for each symbol.
Data structure - Explain quick sort and merge sort algorithms
Quick sort and merge sort algorithms - Quick sort employs the ‘divide and conquer’ concept by dividing the list of elements into two sub elements.......
Data structure - What is Bubble Sort and Quick sort?
Bubble Sort and Quick sort - Bubble Sort: The simplest sorting algorithm. It involves the sorting the list in a repetitive fashion.......
Data structure - What is the difference between a stack and a Queue?
Stack and a Queue - Stack – Represents the collection of elements in Last In First Out order.......