Record Case Detail

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

=================================================================
==112322==ERROR: AddressSanitizer: heap-use-after-free on address 0x603000000138 at pc 0x557639268a62 bp 0x7ffde4e363d0 sp 0x7ffde4e363c0
READ of size 8 at 0x603000000138 thread T0
    #0 0x557639268a61 in BinaryTree::removeAll(TreeNode*) /in/ex6.cpp:112
    #1 0x557639268a78 in BinaryTree::removeAll(TreeNode*) /in/ex6.cpp:112
    #2 0x55763926758e in BinaryTree::~BinaryTree() /in/ex6.cpp:25
    #3 0x557639267a3c in BinaryTree::sum() const /in/ex6.cpp:50
    #4 0x557639267a2a in BinaryTree::sum() const /in/ex6.cpp:51
    #5 0x55763926e313 in test10() /in/compile/TestFunctions.cpp:174
    #6 0x55763927ab0c in std::_Function_handler<void (), void (*)()>::_M_invoke(std::_Any_data const&) /usr/include/c++/7/bits/std_function.h:316
    #7 0x55763927a7e6 in std::function<void ()>::operator()() const /usr/include/c++/7/bits/std_function.h:706
    #8 0x5576392696b5 in runTests(int) /in/compile/TestFunctions.cpp:20
    #9 0x557639266e70 in main /in/comp

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 10: Linear Tree (Left Heavy)
Empty? No

Test 10: Linear Tree (Left Heavy)
Empty? No
Sum: 10
Depth: 4
In-order Traversal: 1 2 3 4

Notes

Stderr

Hints

Your Answer

JOJ Answer