Check if Tree is a Binary Search Tree

A Binary Search Tree is the tree that the key in each node must be greater than or equal to any key stored in the left sub-tree, and less than or equal to any key stored in the right sub-tree.

Binary Search Tree

Binary Search Tree

source: wikipedia

 

 

 


So, what do you think ?