[leetcode 285] Inorder Successor in BST---查找二叉搜索樹中某個節點在中序遍歷中的後續節點

Question:node Given a binary search tree and a node in it, find the in-order successor of that node in the BST.spa Note: If the given node has no in-order successor in the tree, return null.code 分析： 題

>>阅读原文<<