Up to a point, it is better to just let the snags [bugs] be there than to spend such time in design that there are none. Alan M. Turing
Write a program to validate the binary search tree. If it is valid binary search tree returns true; otherwise return false. If binary search tree left node value is greater than or equal to the root node and right node value is less than or equal to the root node is a valid binary search tree.
All Binary Tree Values: 1 2 3 4 Validate: true