Implementation of Huffman encoding algorithm, an optional project from my data structures and algorithms class.
**OBJECTIVE: TO SUCCESSFULLY ENCODE THE ENTIRE BIBLE IN LOWER CASE **
CONTENTS OF FREQUENCY FILE FOR EACH CHARACTER (SPACE IS DENOTED BY THE LETTER N and SPACE THE LETTER S)
i 186963
n 217242
S 766111
t 307057
h 273221
e 398481
b 47360
g 53222
o 234699
d 152446
c 52938
r 164534
a 265754
v 29547
. 25438
w 63396
s 183693
u 81037
f 80662
m 77318
, 68389
; 9968
k 21222
p 41603
N 30382
l 126159
: 12439
y 56852
x 1423
? 3179
' 1943
j 8308
z 2711
q 935
( 214
) 214
! 308
- 23
CONTENTS OF CODES FILE
S 00
e 010
n 0110
o 0111
y 100000
v 1000010
N 1000011
l 10001
a 1001
h 1010
w 101100
, 101101
d 10111
t 1100
m 110100
f 110101
u 110110
j 110111000
; 110111001
k 11011101
p 1101111
r 11100
s 11101
i 11110
b 1111100
' 11111010000
z 11111010001
x 111110100100
! 11111010010100
) 111110100101010
- 1111101001010110
( 1111101001010111
q 1111101001011
? 11111010011
: 111110101
. 11111011
c 1111110
g 1111111
CONTENTS OF THE HUFFMAN TREE(IN PREORDER) EXCLUDING THE FREQUECY NODE
1616533-4047391-2430858
S-1616533-850422
e-850422-451941
n-451941-o
1066146-2430858-1364712
508694-1066146-557452
242940-508694-a
116781-242940-l
y-116781-59929
v-59929-N
h-557452-284231
131785-284231-d
w-131785-,
627175-1364712-737537
t-627175-320118
157980-320118-162138
m-157980-f
u-162138-81101
39498-81101-p
18276-39498-k
j-18276-;
348227-737537-389310
r-348227-s
i-389310-202347
96187-202347-106160
b-96187-48827
23389-48827-.
10950-23389-:
4654-10950-6296
'-4654-z
3117-6296-?
x-3117-1694
759-1694-q
!-759-451
)-451-237
--237-(
c-106160-g
DONE