2017年7月9日
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 keys greater than the original key in BST.Example:... 阅读全文
posted @ 2017-07-09 23:23 xiejunzhao 阅读(290) 评论(0) 推荐(0)
637. Average of Levels in Binary Tree 二叉树每一层的平均值
摘要： Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.Example 1:Input: 3 / \ 9 20 / \ 15 7 Output: [3, 14.5, 11] Explanation: T... 阅读全文
posted @ 2017-07-09 18:06 xiejunzhao 阅读(278) 评论(0) 推荐(0)