[LeetCode] 285. Inorder Successor in BST 二叉搜索树中的中序后继节点
Given a binary search tree and a node in it, find the in-order successor of that node in the BST. The successor of a node p is the node ...
原文：[LeetCode] 510. Inorder Successor in BST II 二叉搜索树中的中序后继节点之二
Given a binary search tree and a node in it, find the in order successor of that node in the BST. The successor of a nodepis the node with the smallest key greater thanp.val. You will have direct acc ...
2019-02-23 23:56 3 1853 推荐指数：
相关推荐
[LeetCode] 450. 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 updated ...
二叉树搜索树中序遍历下的前驱节点与后继节点
前驱节点 前驱节点的值小于该节点的值，是该节点左子树中值最大的 后继节点 后继节点的值大于该节点的值，是该节点右子树中值最小的 因为二叉搜索树的中序遍历出来的结果就是一棵树节点上的值的升序排序，所以一个数的前驱节点的值就是比它小一个的数，后继节点的值就是比它大一 ...
[LeetCode] 230. Kth Smallest Element in a BST 二叉搜索树中的第K小的元素
≤ BST's total elements. Example 1: Example 2: ...
[LeetCode] Minimum Distance Between BST Nodes 二叉搜索树中结点的最小距离
Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree. ...
二叉搜索树的前驱节点和后继节点
前驱结点：节点val值小于该节点val值并且值最大的节点 后继节点：节点val值大于该节点val值并且值最小的节点 二叉树的节点val值是按照二叉树中序遍历顺序连续设定。 前驱结点 如图4的前驱结点是3 2的前驱结点是1 6的前驱结点是5 后继节点 7的后继结点 ...
[LeetCode] Split BST 分割二叉搜索树
Given a Binary Search Tree (BST) with root node root, and a target value V, split the tree into two subtrees where one subtree has nodes ...
【LeetCode】二叉搜索树的前序，中序，后续遍历非递归方法
前序遍历 public List<Integer> preorderTraversal(TreeNode root) { ArrayList<Integer ...