Given a binary tree, determine if it is a valid binary search tree (BST).
Assume a BST is defined as follows:
The left subtree of a node contains only nodes with keys less than the node’s key.
The right subtree of a node contains only nodes with keys greater than the node’s key.
Both the left and right subtrees must also be binary search trees.
题意:给定一棵二叉树,判断它是否为二叉搜索树
解决思路:按照二叉搜索树的性质迭代判断就可以了