A binary tree can be called as a binary search tree if it satisfies the binary search tree property. Explain that property in your own words. Write a recursive algorithm in pseudocode to check whether a given binary tree satisfies the binary search tree property. Would it be easier to write the algorithm using iteration rather than recursion?