How Test if a tree is a binary search tree en c++

Question

How can i Test if a tree is a binary search tree en c++

Answer 1

One of the approach that I can think of is to use the fact that in-order traversal of a BST would always give a sorted list.

So maybe just traverse the tree and see if the array you get is sorted or not