Test case problem


#1

The problem assumes binary search tree. But one of the test case included
`5 3 -1 4 -1 -1’
2

which looks like
5
/
3
/
4

But in binary search tree, the left node value should lager than root value.


#2

My misunderstanding: the first ‘5’ means the number of element in BST. The test case is alright.