Notes
This function is in beta test. Please help improve it in the issues
here.
Hints
Your answer may be identical to the JOJ answer in the first several lines.
However, you will still get Wrong Answer because the complete output may be longer and there might be errors in the future lines.
Please double check your code to solve this problem and try again.
Your Answer
Entering BinaryTree val = 5 Entering BinaryTree val = 15 Entering BinaryTree val = 10 Entering BinaryTree Entering copy Entering copy root is nullptr Entering copy root is nullptr newNode->val = 5 Entering copy Entering copy root is nullptr Entering copy root is nullptr newNode->val = 15 val = 10 left.root = 0x557d45ae9220 right.root = 0x557d45ae9240 Test 1: In-order Traversal: Entering operator<< Entering inOrderPrint Entering inOrderPrint Entering inOrderPrint 5 Entering inOrderPrint 10 Entering inOrderPrint Entering inOrderPrint 15 Entering inOrderPrint Entering ~BinaryTree Entering removeAll root->val = 10 Entering removeAll root->val = 5 Entering removeAll root is nullptr Entering removeAll root is nullptr Entering removeAll root->val = 15 Entering removeAll root is nullptr Entering removeAll root is nullptr Entering ~BinaryTree Entering removeAll root->val = 15 Entering removeAll root is nullptr Entering removeAll root is nullptr Entering ~BinaryTree Entering removeAll root->val = 5 Entering removeAll
JOJ Answer
Test 1: In-order Traversal: 5 10 15