Oct 11, 2023 · Oct 11, 2023 · Oct 11, 2023 · Oct 12, 2023 · Oct 12, 2023 · Oct 15, 2023
diff --git a/Compression/Huffman.js b/Compression/Huffman.js
diff --git a/Compression/test/Huffman.test.js b/Compression/test/Huffman.test.js
Original file line number	Diff line number	Diff line change
Expand Up		@@ -53,10 +53,11 @@ function buildHuffmanTree(freqTable) {
		(char) => new HuffmanNode(char, freqTable[char])
		)


		while (nodes.length > 1) {
	nodes.sort((a, b) => a.freq - b.freq)
	const left = nodes.shift()
	const right = nodes.shift()
	nodes.sort((a, b) => b.freq - a.freq)
	const right = nodes.pop()
	const left = nodes.pop()
		const parent = new HuffmanNode(null, left.freq + right.freq)
		parent.left = left
		parent.right = right
Expand Down Expand Up		@@ -127,16 +128,6 @@ function decodeHuffman(encodedData, root) {
		return decodedData
		}

	// Example usage
	const data = 'this is an example for huffman encoding'
	const freqTable = buildFrequencyTable(data)
	const root = buildHuffmanTree(freqTable)
	const encodedData = encodeHuffman(data, freqTable)
	console.log('Encoded Data:', encodedData)

	const decodedData = decodeHuffman(encodedData, root)
	console.log('Decoded Data:', decodedData)

		export {
		buildHuffmanCodes,
		buildHuffmanTree,
Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -25,9 +25,14 @@ describe('Huffman Coding', () => {
		it('should build Huffman codes correctly', () => {
		const codes = buildHuffmanCodes(root)

	expect(codes['t']).toEqual('01010')
	expect(codes['h']).toEqual('11111')
	expect(codes['i']).toEqual('1001')
	expect(codes['s']).toEqual('0010')
	console.log(codes['t'])
	console.log(codes['h'])
	console.log(codes['i'])
	console.log(codes['s'])

	expect(codes['t']).toEqual('01101')
	expect(codes['h']).toEqual('0111')
	expect(codes['i']).toEqual('0100')
	expect(codes['s']).toEqual('1010')
		})
		})