<Check if an input of integers (assuming they are ...

# stackoverflow

[user]

Check if an input of integers (assuming they are a Binary tree) is a Valid binary search tree?
it is just one question, and of course any available data and coding examples are more than welcome.
I am trying to input some integers ( 12345679 ) over an EditText, and pass them like if they were a Binary tree already, then checking if this "supposed tree" is a Binary Search Tree.
I HAVE BEEN RESEARCHING MORE THAN A WEEK, and i could not find anything close to this for JAVA or KOTLIN...please i need your help! seriously.. any available example..pieces of work ... they are more than...