Given a binary tree, determine if it is a valid binary search tree (BST).

思路:定义一个数组,按照中序输出的方式将值放入数组中,然后遍历比较,满足从小到大排列,则满足二叉搜索树。

猜你喜欢

转载自blog.csdn.net/CDatreides/article/details/82020053