2017年7月8日
LeetCode 538. Convert BST to Greater Tree （把二叉搜索树转换成较大树）
摘要： Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all 阅读全文
posted @ 2017-07-08 05:37 Jimmy_Cheng 阅读(324) 评论(0) 推荐(0)
LeetCode 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 @ 2017-07-08 03:07 Jimmy_Cheng 阅读(532) 评论(0) 推荐(0)