2019年10月9日
LC 98. Validate Binary Search Tree
摘要： 题目描述 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 阅读全文
posted @ 2019-10-09 18:59 schaffen 阅读(165) 评论(0) 推荐(0)
LC 173. Binary Search Tree Iterator
摘要： 题目描述 Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next() will return 阅读全文
posted @ 2019-10-09 18:57 schaffen 阅读(185) 评论(0) 推荐(0)