2019年6月1日
530. Minimum Absolute Difference in BST
摘要： Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes. Example: Note: There are at 阅读全文
posted @ 2019-06-01 21:03 ChuckLu 阅读(304) 评论(0) 推荐(0)
501. Find Mode in Binary Search Tree
摘要： Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given BST. Assume a BST is define 阅读全文
posted @ 2019-06-01 15:28 ChuckLu 阅读(187) 评论(0) 推荐(0)