A binary tree can be called as a binary search tree if it satisfies the binary search tree property. Write a recursive algorithm in pseudocode that uses a tree traversal (preorder or postorder ) to...

A binary tree can be called as a binary search tree if it satisfies the binary search tree property.

Write a recursive algorithm in pseudocode that uses a treetraversal (preorder or postorder) to check whether a given binary tree satisfies the binary search tree property.

C++ Algorithm!