Record Case Detail

Notes

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

Stderr

=================================================================
==119102==ERROR: LeakSanitizer: detected memory leaks

Direct leak of 24 byte(s) in 1 object(s) allocated from:
    #0 0x7fc9917c7448 in operator new(unsigned long) (/usr/lib/x86_64-linux-gnu/libasan.so.4+0xe0448)
    #1 0x55a07158b637 in BinaryTree::copy(TreeNode*) /in/ex6.cpp:109
    #2 0x55a07158b85c in BinaryTree::copy(TreeNode*) /in/ex6.cpp:113
    #3 0x55a07158a505 in BinaryTree::BinaryTree(int, BinaryTree const&, BinaryTree const&) /in/ex6.cpp:19
    #4 0x55a07158c3da in buildBalancedTree(int) /in/compile/TestFunctions.cpp:41
    #5 0x55a07158c365 in buildBalancedTree(int) /in/compile/TestFunctions.cpp:38
    #6 0x55a07158c365 in buildBalancedTree(int) /in/compile/TestFunctions.cpp:38
    #7 0x55a07158f968 in test8() /in/compile/TestFunctions.cpp:147
    #8 0x55a07159d662 in std::_Function_handler<void (), void (*)()>::_M_invoke(std::_Any_data const&) /usr/include/c++/7/bits/std_function.h:316
    #9 0x55a07159d33c in std::function<void

Hints

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.

Your Answer

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 

JOJ Answer

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