2018年3月15日
671. Second Minimum Node In a Binary Tree
摘要： Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. 阅读全文
posted @ 2018-03-15 19:40 __Meng 阅读(118) 评论(0) 推荐(0)
108. Convert Sorted Array to Binary Search Tree
摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is d 阅读全文
posted @ 2018-03-15 18:53 __Meng 阅读(191) 评论(0) 推荐(0)
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 @ 2018-03-15 16:23 __Meng 阅读(104) 评论(0) 推荐(0)