Record Case Detail

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

=================================================================
==119112==ERROR: LeakSanitizer: detected memory leaks

Direct leak of 24 byte(s) in 1 object(s) allocated from:
    #0 0x7fc1b072f448 in operator new(unsigned long) (/usr/lib/x86_64-linux-gnu/libasan.so.4+0xe0448)
    #1 0x55a1aea61637 in BinaryTree::copy(TreeNode*) /in/ex6.cpp:109
    #2 0x55a1aea6185c in BinaryTree::copy(TreeNode*) /in/ex6.cpp:113
    #3 0x55a1aea60505 in BinaryTree::BinaryTree(int, BinaryTree const&, BinaryTree const&) /in/ex6.cpp:19
    #4 0x55a1aea62bb4 in buildLinearTree(int, bool) /in/compile/TestFunctions.cpp:82
    #5 0x55a1aea62b5d in buildLinearTree(int, bool) /in/compile/TestFunctions.cpp:79
    #6 0x55a1aea62b5d in buildLinearTree(int, bool) /in/compile/TestFunctions.cpp:79
    #7 0x55a1aea62b5d in buildLinearTree(int, bool) /in/compile/TestFunctions.cpp:79
    #8 0x55a1aea62b5d in buildLinearTree(int, bool) /in/compile/TestFunctions.cpp:79
    #9 0x55a1aea62b5d in buildLinearTree(int, bool) /in/compile/TestFuncti

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 17: Left Heavy Linear Tree
Depth: 9
Sum: 36
In-order Traversal: 0 1 0 2 0 3 0 4 0 5 0 6 0 7 0 8 0

Test 17: Left Heavy Linear Tree
Depth: 8
Sum: 36
In-order Traversal: 1 2 3 4 5 6 7 8

Notes

Stderr

Hints

Your Answer

JOJ Answer