Record Case Detail

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

=================================================================
==53984==ERROR: AddressSanitizer: alloc-dealloc-mismatch (operator new vs operator delete []) on 0x603000000040
    #0 0x7f9ad5a77480 in operator delete[](void*) (/usr/lib/x86_64-linux-gnu/libasan.so.4+0xe1480)
    #1 0x564017980171 in BinaryTree::~BinaryTree() /in/ex6.cpp:87
    #2 0x564017980a53 in buildBalancedTree(int) /in/compile/TestFunctions.cpp:37
    #3 0x5640179809d1 in buildBalancedTree(int) /in/compile/TestFunctions.cpp:36
    #4 0x5640179809d1 in buildBalancedTree(int) /in/compile/TestFunctions.cpp:36
    #5 0x564017983f8f in test8() /in/compile/TestFunctions.cpp:144
    #6 0x564017991c0e in std::_Function_handler<void (), void (*)()>::_M_invoke(std::_Any_data const&) /usr/include/c++/7/bits/std_function.h:316
    #7 0x5640179918e8 in std::function<void ()>::operator()() const /usr/include/c++/7/bits/std_function.h:706
    #8 0x564017980877 in runTests(int) /in/compile/TestFunctions.cpp:19
    #9 0x56401797ef70 in main /in/compile/

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 8: Balanced Tree
Empty? No
Sum: 26
Depth: 4
In-order Traversal: 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1

Notes

Stderr

Hints

Your Answer

JOJ Answer