leetcode二叉搜索树
leetcode二叉搜索类题目
Bryan要加油
这个作者很懒,什么都没留下…
展开
-
95. Unique Binary Search Trees II(Leetcode每日一题-2020.07.21)
ProblemGiven an integer n, generate all structurally unique BST’s (binary search trees) that store values 1 … n.Constraints:0 <= n <= 8ExampleSolution/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeN原创 2020-07-22 21:09:19 · 175 阅读 · 0 评论 -
108. Convert Sorted Array to Binary Search Tree(Leetcode每日一题-2020.07.03)
ProblemGiven 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 defined as a binary tree in which the depth of the two subtrees of every node never differ by more原创 2020-07-04 09:41:12 · 228 阅读 · 0 评论 -
1008. Construct Binary Search Tree from Preorder Traversal
ProblemReturn the root node of a binary search tree that matches the given preorder traversal.(Recall that a binary search tree is a binary tree where for every node, any descendant of node.left has...原创 2020-03-12 22:42:41 · 115 阅读 · 0 评论 -
701. Insert into a Binary Search Tree
ProblemGiven the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root node of the BST after the insertion. It is guaranteed...原创 2020-03-12 22:05:53 · 110 阅读 · 0 评论 -
98. Validate Binary Search Tree &&面试题 04.05. Legal Binary Search Tree LCCI(Leetcode每日一题-2020.05.05)
ProblemGiven a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node’s key....原创 2020-03-11 23:45:19 · 186 阅读 · 0 评论 -
1305. All Elements in Two Binary Search Trees
ProblemGiven two binary search trees root1 and root2.Return a list containing all the integers from both trees sorted in ascending order.Example1Input: root1 = [2,1,4], root2 = [1,0,3]Output: [...原创 2020-03-09 23:19:26 · 485 阅读 · 0 评论 -
面试题 04.06. Successor LCCI
ProblemWrite an algorithm to find the “next” node (i.e., in-order successor) of a given node in a binary search tree.Return null if there’s no “next” node for the given node.Example1Example2Sol...原创 2020-03-06 20:04:09 · 217 阅读 · 0 评论 -
938. Range Sum of BST
ProblemGiven the root node of a binary search tree, return the sum of values of all nodes with value between L and R (inclusive).The binary search tree is guaranteed to have unique values.Example1...原创 2020-03-02 21:08:29 · 141 阅读 · 0 评论 -
538. Convert BST to Greater Tree && 1038. Binary Search Tree to Greater Sum Tree
Problem538Given 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 ...原创 2020-03-01 20:05:46 · 202 阅读 · 0 评论 -
530. Minimum Absolute Difference in BST
ProblemGiven a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.ExampleSolutionBST中差值绝对值最小,只能出现在相邻节点。本题与501题是类似的。/** * Definiti...原创 2020-03-01 19:50:58 · 100 阅读 · 0 评论 -
501. Find Mode in Binary Search Tree
ProblemGiven 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 defined as follows:The left subtree of a node c...原创 2020-03-01 16:33:04 · 132 阅读 · 0 评论 -
897. Increasing Order Search Tree && 面试题 17.12. BiNode LCCI
ProblemThe data structure TreeNode is used for binary tree, but it can also used to represent a single linked list (where left is null, and right is the next node in the list). Implement a method to ...原创 2020-02-27 22:42:11 · 553 阅读 · 0 评论 -
面试题54. 二叉搜索树的第k大节点
Problem给定一棵二叉搜索树,请找出其中第k大的节点。Example 1Example 2SolutionSolution1利用BST中序遍历为递增序列的特性,将遍历结果储存在数组中,然后从后向前找到第k个数。Solution2BST反向中序遍历(右->中->左)的结果是递减序列。所以在反向中序过程中,记录当前遍历的是第几个节点,当遍历到第k个时,就是结果。/...原创 2020-02-26 23:23:12 · 427 阅读 · 0 评论 -
面试题 04.02. Minimum Height Tree LCCI
ProblemGiven a sorted (increasing order) array with unique integer elements, write an algorithm to create a binary search tree with minimal height.Example1Solution/** * Definition for a binary ...原创 2020-02-25 23:05:31 · 209 阅读 · 0 评论 -
235. Lowest Common Ancestor of a Binary Search Tree&&面试题68 - I. 二叉搜索树的最近公共祖先
ProblemGiven a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined b...原创 2020-02-24 23:16:08 · 191 阅读 · 0 评论 -
653. Two Sum IV - Input is a BST
ProblemGiven a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target.Example1Example2Solution二叉搜索树中序遍历的结果,是...原创 2020-02-16 22:40:34 · 174 阅读 · 0 评论 -
669. Trim a Binary Search Tree
ProblemGiven a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R >= L). You might need to change the root of the tree, s...原创 2020-02-15 23:49:06 · 151 阅读 · 0 评论