Record Case Detail

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

=================================================================
==119104==ERROR: LeakSanitizer: detected memory leaks

Direct leak of 24 byte(s) in 1 object(s) allocated from:
    #0 0x7ff9767bb448 in operator new(unsigned long) (/usr/lib/x86_64-linux-gnu/libasan.so.4+0xe0448)
    #1 0x5590e2d0a637 in BinaryTree::copy(TreeNode*) /in/ex6.cpp:109
    #2 0x5590e2d0a85c in BinaryTree::copy(TreeNode*) /in/ex6.cpp:113
    #3 0x5590e2d09505 in BinaryTree::BinaryTree(int, BinaryTree const&, BinaryTree const&) /in/ex6.cpp:19
    #4 0x5590e2d0bbb4 in buildLinearTree(int, bool) /in/compile/TestFunctions.cpp:82
    #5 0x5590e2d0bb5d in buildLinearTree(int, bool) /in/compile/TestFunctions.cpp:79
    #6 0x5590e2d0bb5d in buildLinearTree(int, bool) /in/compile/TestFunctions.cpp:79
    #7 0x5590e2d0bb5d in buildLinearTree(int, bool) /in/compile/TestFunctions.cpp:79
    #8 0x5590e2d0fafa in test10() /in/compile/TestFunctions.cpp:171
    #9 0x5590e2d1c662 in std::_Function_handler<void (), void (*)()>::_M_invoke(std::_Any_d

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
Sum: 10
Depth: 5
In-order Traversal: 0 1 0 2 0 3 0 4 0

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