You are viewing a single comment's thread. Return to all comments →
Hi, I know it's been three months since your comment, but I faced the same problem as you just now.
The problem with your (our) approach is that it only checks the upper or lower bound for each side, respectively.
Basically, there needs to be both an upper AND lower bound for each branch/node check. Some of the other submissions do this very well. This way all branches/nodes to the left are lower than the one above it, and all of the branches/nodes to the right are greater than the one above it.