Hello everyone,
I'm working on a lab and my implementation failed a test case for a binary tree algorithm. The output says:
--------------------
Test 5 failed!
left: 3 2 -1 -1
right: 1 -1 -1 -1
--------------------
This is the structure for the binary tree where my code failed but I don't know what the BT looks like based off of the integers in left and right. If you know how to translate this into a binary tree or if it's not even possible please let me know, thanks.