LeetCode第[98]题(Java):Validate Binary Search Tree(验证二叉搜索树)
摘要:
题目:验证二叉搜索树 难度:Medium 题目内容: Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subt 阅读全文
posted @ 2018-05-30 17:00 清风吹斜阳 阅读(2257) 评论(1) 推荐(1) 编辑