Record Case Detail

This function is in beta test. Please help improve it in the issues here.

=================================================================
==21786==ERROR: AddressSanitizer: heap-use-after-free on address 0x606000001670 at pc 0x00000051c395 bp 0x7ffcedf28f90 sp 0x7ffcedf28f88
READ of size 8 at 0x606000001670 thread T0
    #0 0x51c394  (/out/package/test_decom+0x51c394)
    #1 0x52b970  (/out/package/test_decom+0x52b970)
    #2 0x52c04d  (/out/package/test_decom+0x52c04d)
    #3 0x7fbfad9cab96  (/lib/x86_64-linux-gnu/libc.so.6+0x21b96)
    #4 0x41f909  (/out/package/test_decom+0x41f909)

0x606000001670 is located 48 bytes inside of 56-byte region [0x606000001640,0x606000001678)
freed by thread T0 here:
    #0 0x518ae8  (/out/package/test_decom+0x518ae8)
    #1 0x51ca02  (/out/package/test_decom+0x51ca02)
    #2 0x51ca4c  (/out/package/test_decom+0x51ca4c)
    #3 0x5241e4  (/out/package/test_decom+0x5241e4)
    #4 0x52c081  (/out/package/test_decom+0x52c081)
    #5 0x7fbfad9cab96  (/lib/x86_64-linux-gnu/libc.so.6+0x21b96)

previously allocated by thread T0 here:
    #0 0x517d70  (/ou

Your answer may be identical to the JOJ answer in the first several lines.

However, the main problem you meet now is Runtime Error. And the exit code of your program is 1, which should be 0.

Please double check your code to solve this problem and try again.

this project will give you experience in writing recursive functions that operate on a recursively constructed data structure binary tree also you will practice using file streams adts and dynamic memory besides you will learn about huffman coding which is an interesting application of binary trees to file compression

Notes

Stderr

Hints

Your Answer

JOJ Answer