Notes
This function is in beta test. Please help improve it in the issues
here.
================================================================= ==119108==ERROR: LeakSanitizer: detected memory leaks Direct leak of 24 byte(s) in 1 object(s) allocated from: #0 0x7f87b5263448 in operator new(unsigned long) (/usr/lib/x86_64-linux-gnu/libasan.so.4+0xe0448) #1 0x55fb129bc637 in BinaryTree::copy(TreeNode*) /in/ex6.cpp:109 #2 0x55fb129bc85c in BinaryTree::copy(TreeNode*) /in/ex6.cpp:113 #3 0x55fb129bb505 in BinaryTree::BinaryTree(int, BinaryTree const&, BinaryTree const&) /in/ex6.cpp:19 #4 0x55fb129bdc25 in buildLinearTree(int, bool) /in/compile/TestFunctions.cpp:84 #5 0x55fb129bdb5d in buildLinearTree(int, bool) /in/compile/TestFunctions.cpp:79 #6 0x55fb129bdb5d in buildLinearTree(int, bool) /in/compile/TestFunctions.cpp:79 #7 0x55fb129bdb5d in buildLinearTree(int, bool) /in/compile/TestFunctions.cpp:79 #8 0x55fb129bdb5d in buildLinearTree(int, bool) /in/compile/TestFunctions.cpp:79 #9 0x55fb129bdb5d in buildLinearTree(int, bool) /in/compile/TestFuncti
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 13: Right Heavy Linear Tree Empty? No Sum: 21 Depth: 7 In-order Traversal: 0 6 0 5 0 4 0 3 0 2 0 1 0
JOJ Answer
Test 13: Right Heavy Linear Tree Empty? No Sum: 21 Depth: 6 In-order Traversal: 6 5 4 3 2 1