Given a binary tree, this recipe will cover how to verify if it actually satisfies the order property such that all elements in the left subtree are of lesser value, and that all values of the right subtree are of greater value.
No imports are necessary for this recipe. Perform the following steps to find if the tree is a binary search tree:
Define a data structure for a binary tree:
data Tree a = Node { value :: a , left :: (Tree a) , right :: (Tree a)} | Null deriving (Eq, Show)Construct a tree based on the preceding diagram:
someTree :: Tree Int someTree = root where root = Node 0 n1 n4 n1 = Node 1 n2 n3 n2 = Node 2 Null Null n3 = Node 3 Null Null n4 = Node 4 Null NullDefine the function to verify whether or not a tree obeys the binary...