[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.
Note: If the given node has no in-order successor in the tree, return null.
DiffcultyMedium
Similar Problems
[LeetCode 173] Binary Search Tree Iterator Medium
[LeetCode 94] Binary Tree Inorder Traversal Medium