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 with the smallest key greater than p.val.

Example 1:


Input: root = [2,1,3], p = 1
Output: 2
Explanation: 1's in-order successor node is 2. Note that both p and the return value is of TreeNode type.

Example 2:

Input: root = [5,3,6,2,4,null,null,1], p = 6
Output: null
Explanation: There is no in-order successor of the current node, so the answer is null.

Note:

If the given node has no in-order successor in the tree, return null.
It’s guaranteed that the values of the tree are unique.

方法1: stack （iterative）

思路：

和94. Binary Tree Inorder Traversal的方法一样，同时用一个bool来记录是否已经在inorder的过程中遇到了p，flag一下，那么下一个被pop出栈的就是p的successor。

易错点

1. p的successor是p出栈后出栈的第一个node

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* inorderSuccessor(TreeNode* root, TreeNode* p) {
        stack<TreeNode*> st;
        bool found = false;
        while (true){
            if (root){
                st.push(root);
                root = root -> left;
            }
            else {
                if (st.empty()) break;
                root = st.top();
                st.pop();
                if (found == true) return root;
                
                if (root == p) found = true;
                root = root -> right;
            }
        }
        return nullptr;
    }
};