binary search tree
文章平均质量分 66
小榕流光
这个作者很懒,什么都没留下…
展开
-
[leetcode] 450. Delete Node in a BST 解题报告
题目链接: https://leetcode.com/problems/delete-node-in-a-bst/Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly u原创 2016-12-01 15:24:38 · 3426 阅读 · 0 评论 -
clockwise print binary search tree
给一个二叉树, 顺时针打印出所有的节点, 例如:应该打印: 20, 8, 4, 10, 14, 25, 22思路: 可以分为三步打印:1. 打印左边界, 最后一个叶子节点不打印2. 打印所有叶子结点3. 打印右边界, 根和最后一个叶子结点不打印代码如下: void printLeft(TreeNode* root){ if(原创 2016-12-10 14:47:11 · 937 阅读 · 0 评论 -
[leetcode] 449. Serialize and Deserialize BST 解题报告
题目链接:https://leetcode.com/problems/serialize-and-deserialize-bst/Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file原创 2016-11-08 03:05:55 · 3169 阅读 · 0 评论 -
[leetcode] 404. Sum of Left Leaves 解题报告
题目链接:https://leetcode.com/problems/sum-of-left-leaves/Find the sum of all left leaves in a given binary tree.Example: 3 / \ 9 20 / \ 15 7There are two left leave原创 2016-10-10 03:23:03 · 918 阅读 · 0 评论 -
[leetcode] 272. Closest Binary Search Tree Value II 解题报告
题目链接:https://leetcode.com/problems/closest-binary-search-tree-value-ii/Given a non-empty binary search tree and a target value, find k values in the BST that are closest to the target.Note:原创 2016-03-25 16:59:18 · 4088 阅读 · 0 评论 -
[leetcode] 333. Largest BST Subtree 解题报告
题目链接: https://leetcode.com/problems/largest-bst-subtree/Given a binary tree, find the largest subtree which is a Binary Search Tree (BST), where largest means subtree with largest number of node原创 2016-06-22 05:21:59 · 5154 阅读 · 0 评论 -
[leetcode] 356. Line Reflection 解题报告
题目链接: https://leetcode.com/problems/line-reflection/Given n points on a 2D plane, find if there is such a line parallel to y-axis that reflect the given set of points.Example 1:Given p原创 2016-06-25 06:07:35 · 4017 阅读 · 0 评论 -
[leetcode] 270. Closest Binary Search Tree Value 解题报告
题目链接:https://leetcode.com/problems/closest-binary-search-tree-value/Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target.Note:原创 2016-06-15 15:08:53 · 1337 阅读 · 0 评论 -
[leetcode] 220. Contains Duplicate III 解题报告
题目链接:https://leetcode.com/problems/contains-duplicate-iii/Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i原创 2016-01-30 11:09:05 · 3267 阅读 · 0 评论 -
[leetcode] 95. Unique Binary Search Trees II 解题报告
题目链接:https://leetcode.com/problems/unique-binary-search-trees-ii/Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your原创 2015-11-06 15:14:51 · 753 阅读 · 0 评论 -
[leetcode] 352. Data Stream as Disjoint Intervals 解题报告
题目链接: https://leetcode.com/problems/data-stream-as-disjoint-intervals/Given a data stream input of non-negative integers a1, a2, ..., an, ..., summarize the numbers seen so far as a list of di原创 2016-06-01 07:24:10 · 6772 阅读 · 0 评论 -
[leetcode] 437. Path Sum III 解题报告
题目链接: https://leetcode.com/problems/path-sum-iii/You are given a binary tree in which each node contains an integer value.Find the number of paths that sum to a given value.The path does原创 2016-12-01 15:45:27 · 1514 阅读 · 0 评论