This repository aims to solve and create new problems from different spheres of coding. A path to help students to get access to solutions and discuss their doubts.
1) Create a leaf node of each unique char and store it in set (i.e in the form of pair of integer and node).
2) Extract two nodes with minimum frequency from set (i.e First two elements from set).
3) Create a new node equal to sum of frequency of two nodes. Make the first extracted node as left child and second extracted node as right child. Add this node to the set.
4) Repeat step number 2 and 3 until the set contains only one element. Remaining node is the root node of Huffman Tree.
5) Now start from the root node and traverse the tree left and right. Left edge mark with 0 and right edge mark with 1. Print the char along with the code for each and every leaf node.
Screenshots(Attach 2 screenshots of your own input and output) -
Input:
Output:
Checklist:
Eg - If your code follow the below guidelines. Kindly change [] to [x]
All the conditions should be fulfilled for considering your code for merging -
[x] I have mentioned the question as comment in my solution file.
[x] My code follows the guidelines of this project.
[x] I have performed a self-review of my own code.
[x] I have commented my code.
[x] My code gives the correct output.
[x] I confirm that I have not copied the code from anywhere. In case its found that I have copied even after successful merge then I can be banned from the repository and hacktoberfest.
[x] I affirm that I strictly follow contributing guidelines and code of conduct.
Issue Id you have worked upon -
309
Briefly explain your program logic -
1) Create a leaf node of each unique char and store it in set (i.e in the form of pair of integer and node). 2) Extract two nodes with minimum frequency from set (i.e First two elements from set). 3) Create a new node equal to sum of frequency of two nodes. Make the first extracted node as left child and second extracted node as right child. Add this node to the set. 4) Repeat step number 2 and 3 until the set contains only one element. Remaining node is the root node of Huffman Tree. 5) Now start from the root node and traverse the tree left and right. Left edge mark with 0 and right edge mark with 1. Print the char along with the code for each and every leaf node.
Screenshots(Attach 2 screenshots of your own input and output) -
Input:
Output:
Checklist:
Eg - If your code follow the below guidelines. Kindly change [] to [x]
All the conditions should be fulfilled for considering your code for merging -
[x] I have mentioned the question as comment in my solution file.
[x] My code follows the guidelines of this project.
[x] I have performed a self-review of my own code.
[x] I have commented my code.
[x] My code gives the correct output.
[x] I confirm that I have not copied the code from anywhere. In case its found that I have copied even after successful merge then I can be banned from the repository and hacktoberfest.
[x] I affirm that I strictly follow contributing guidelines and code of conduct.