Record Case Detail

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

=================================================================
==52358==ERROR: AddressSanitizer: alloc-dealloc-mismatch (operator new vs operator delete []) on 0x603000000040
    #0 0x7f4987885480 in operator delete[](void*) (/usr/lib/x86_64-linux-gnu/libasan.so.4+0xe1480)
    #1 0x565319001051 in BinaryTree::~BinaryTree() /in/ex6.cpp:87
    #2 0x565319001933 in buildBalancedTree(int) /in/compile/TestFunctions.cpp:37
    #3 0x5653190018b1 in buildBalancedTree(int) /in/compile/TestFunctions.cpp:36
    #4 0x5653190018b1 in buildBalancedTree(int) /in/compile/TestFunctions.cpp:36
    #5 0x5653190018b1 in buildBalancedTree(int) /in/compile/TestFunctions.cpp:36
    #6 0x5653190018b1 in buildBalancedTree(int) /in/compile/TestFunctions.cpp:36
    #7 0x5653190018b1 in buildBalancedTree(int) /in/compile/TestFunctions.cpp:36
    #8 0x5653190018b1 in buildBalancedTree(int) /in/compile/TestFunctions.cpp:36
    #9 0x565319009936 in test16() /in/compile/TestFunctions.cpp:231
    #10 0x565319012956 in std::_Function_handl

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 16: Large Balanced Tree
Depth: 8
Sum: 502
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

Notes

Stderr

Hints

Your Answer

JOJ Answer