[ ASSIGNMENT: ] Binary search tree validation

Question

A binary search tree is a binary tree that is ordered. This means that if you were to convert the tree to an array using an in-order traversal, the array would be in sorted order. The benefit gained by this ordering is that when the tree is balanced, searching is a logarithmic time operation, since each node you look at that isn't the one you're searching for lets you discard half of the tree.

TASK:
Write a function that will validate that a given binary tree is a binary search tree. The sort order
is not predefined so it should work with either.

These are valid binary search trees:

5
/ \
2 7
/ \ \
1 3 9

7
/ \
9 2

while these are not:

1
/ \
2 3

5
/ \
2 9
\
7

There are several different approaches you can take to solve this task. If you're not as comfortable with recursion I'd recommend practicing that.

Note: no test case tree will contain duplicate numbers!

HappyCodings! :)

Answer 1

Åtomıc
Will you do the task and set your code! 👍😉

Answer 2

My try:

https://code.sololearn.com/ciDdioODi2H1/?ref=app

Answer 3

I can see the algorithm and I don't even know recursion

Answer 4

I'll try 😃

Answer 5

https://code.sololearn.com/cLFIdoYl5KTo/?ref=app

Answer 6

https://code.sololearn.com/cXFD6q4ZgGRl/?ref=app

Answer 7

my approach, with a simple Node class
And checking Recursive path with sorted values!!
Hope you like it! 😀

https://code.sololearn.com/cwZQM2IjofXu/?ref=app