原题链接在这里:https://leetcode.com/problems/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 node p is the node with the smallest key greater than p.val. Y…

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 with the smallest key greater than p.val. Example 1: Input: root = [2,1,3], p = 1 Output: 2 Explanation: 1's in-or…

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 with the smallest key greater than p.val. You will have direct access to the node but not to the root of the tree.…

Given a binary search tree and a node in it, find the in-order successor of that node in the BST. 本题要求查找p在树中的inorder successor(中序遍历时的下一个节点).根据p和root的关系,有三种情况. 1. p在root的左子树中: 1.1 p在左子树中的successor不为空,那么输出这个successor 1.2 p在左子树中的successor为空,那么p的successo…

Given a binary search tree and a node in it, find the in-order successor of that node in the BST. Note: If the given node has no in-order successor in the tree, return null. 这道题让我们求二叉搜索树的某个节点的中序后继节点,那么我们根据BST的性质知道其中序遍历的结果是有序的, 是我最先用的方法是用迭代的中序遍历方法,然后用…

原题链接在这里:https://leetcode.com/problems/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. Note: If the given node has no in-order successor in the tree, return null. Show Company…

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. Example Given tree = [2,1] and node = 1: 2 / 1 return node 2. Given tree = [2,1,3] and node = 2: 2 / \1 3 return node 3. Note I…

题目: Given a binary search tree and a node in it, find the in-order successor of that node in the BST. Note: If the given node has no in-order successor in the tree, return null. 链接: http://leetcode.com/problems/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 with the smallest key greater than p.val. Example 1: Input: root = [2,1,3], p = 1 Output: 2 Explanation: 1's in-or…

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 with the smallest key greater than p.val. Example 1: Input: root = [2,1,3], p = 1 Output: 2 Explanation: 1's in-or…