Record Case Detail

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

=================================================================
==112329==ERROR: AddressSanitizer: heap-use-after-free on address 0x6030000d9068 at pc 0x55bd239d3a62 bp 0x7ffcac88c9d0 sp 0x7ffcac88c9c0
READ of size 8 at 0x6030000d9068 thread T0
    #0 0x55bd239d3a61 in BinaryTree::removeAll(TreeNode*) /in/ex6.cpp:112
    #1 0x55bd239d3a78 in BinaryTree::removeAll(TreeNode*) /in/ex6.cpp:112
    #2 0x55bd239d258e in BinaryTree::~BinaryTree() /in/ex6.cpp:25
    #3 0x55bd239d2a3c in BinaryTree::sum() const /in/ex6.cpp:50
    #4 0x55bd239d2a2a in BinaryTree::sum() const /in/ex6.cpp:51
    #5 0x55bd239d2a2a in BinaryTree::sum() const /in/ex6.cpp:51
    #6 0x55bd239d2a2a in BinaryTree::sum() const /in/ex6.cpp:51
    #7 0x55bd239d2a2a in BinaryTree::sum() const /in/ex6.cpp:51
    #8 0x55bd239d2a2a in BinaryTree::sum() const /in/ex6.cpp:51
    #9 0x55bd239d2a2a in BinaryTree::sum() const /in/ex6.cpp:51
    #10 0x55bd239d2a2a in BinaryTree::sum() const /in/ex6.cpp:51
    #11 0x55bd239d2a2a in BinaryTree::sum() const

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 24: Extremely Large Balanced Tree
Empty? No

Test 24: Extremely Large Balanced Tree
Empty? No
Sum: 4083
Depth: 11
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

Notes

Stderr

Hints

Your Answer

JOJ Answer