Record Case Detail

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

=================================================================
==121962==ERROR: AddressSanitizer: heap-use-after-free on address 0x603000060078 at pc 0x56394bb4ea62 bp 0x7ffdde362660 sp 0x7ffdde362650
READ of size 8 at 0x603000060078 thread T0
    #0 0x56394bb4ea61 in BinaryTree::removeAll(TreeNode*) /in/ex6.cpp:112
    #1 0x56394bb4ea78 in BinaryTree::removeAll(TreeNode*) /in/ex6.cpp:112
    #2 0x56394bb4d58e in BinaryTree::~BinaryTree() /in/ex6.cpp:25
    #3 0x56394bb4da3c in BinaryTree::sum() const /in/ex6.cpp:50
    #4 0x56394bb4da2a in BinaryTree::sum() const /in/ex6.cpp:51
    #5 0x56394bb4da2a in BinaryTree::sum() const /in/ex6.cpp:51
    #6 0x56394bb4da2a in BinaryTree::sum() const /in/ex6.cpp:51
    #7 0x56394bb4da2a in BinaryTree::sum() const /in/ex6.cpp:51
    #8 0x56394bb4da2a in BinaryTree::sum() const /in/ex6.cpp:51
    #9 0x56394bb4da2a in BinaryTree::sum() const /in/ex6.cpp:51
    #10 0x56394bb4da2a in BinaryTree::sum() const /in/ex6.cpp:51
    #11 0x56394bb5a2a5 in test21() /in/compile/Tes

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.

Test 21: Very Large Balanced Tree
Empty? No

Test 21: Very Large Balanced Tree
Empty? No
Sum: 2036
Depth: 10
In-order Traversal: 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 7 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 8 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 7 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 9 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 7 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 8 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 7 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2

Notes

Stderr

Hints

Your Answer

JOJ Answer