Create inorder_successor_in_bst.cpp

Author: avidLearnerInProgress

inorder_successor_in_bst.cpp

@@ -0,0 +1,35 @@
+/**
+ * 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:
+    /*
+     * @param root: The root of the BST.
+     * @param p: You need find the successor node of p.
+     * @return: Successor of p.
+     */
+    
+    TreeNode *successor = nullptr;
+    TreeNode * inorderSuccessor(TreeNode * root, TreeNode * p) {
+        // write your code here
+         
+        if(root == nullptr) {
+            return nullptr;
+        }
+        
+        if(root->val <= p->val) {
+            return inorderSuccessor(root->right, p);
+        }
+        
+        TreeNode *successor = inorderSuccessor(root->left, p);
+        return successor == nullptr ? root : successor;
+    }
+};