public bool IsBSTUtil(BinarySearchTree.Node node, int minValue, int maxValue) { if (node == null) { return(true); } if (node.key > minValue && node.key < maxValue && IsBSTUtil(node.Left, minValue, node.key) && IsBSTUtil(node.Right, node.key, maxValue)) { return(true); } return(false); }
public bool IsBST(BinarySearchTree.Node node) { return(IsBSTUtil(node, Int32.MinValue, Int32.MaxValue)); }