Disordered Binary Search Trees
March 10, 2017
In a recent exercise we wrote a program to determine if a binary tree was balanced. Today’s exercise is similar:
Write a program to determine if a binary tree satisfies the binary search tree property that all left children are less than their parent and all right children are greater than their parent.
Your task is to write a program to determine if a binary tree is a binary search tree. When you are finished, you are welcome to read or run a suggested solution, or to post your own solution or discuss the exercise in the comments below.
Programming Praxis 