0510 solved.

liuyubobobo · liuyubobobo · commit 10825343f14a · 2022-07-08T14:56:58.000-07:00
diff --git a/0501-1000/0510-Inorder-Successor-in-BST-II/cpp-0510/CMakeLists.txt b/0501-1000/0510-Inorder-Successor-in-BST-II/cpp-0510/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.22)
+project(cpp_0510)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(cpp_0510 main.cpp)
diff --git a/0501-1000/0510-Inorder-Successor-in-BST-II/cpp-0510/main.cpp b/0501-1000/0510-Inorder-Successor-in-BST-II/cpp-0510/main.cpp
@@ -0,0 +1,56 @@
+/// Source : https://leetcode.com/problems/inorder-successor-in-bst-ii/s
+/// Author : liuyubobobo
+/// Time   : 2022-07-08
+
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+
+/// Tree Algorithm
+/// Time Compelxity: O(h)
+/// Space Compelxity: O(1)
+
+// Definition for a Node.
+class Node {
+public:
+    int val;
+    Node* left;
+    Node* right;
+    Node* parent;
+};
+
+class Solution {
+public:
+    Node* inorderSuccessor(Node* node) {
+
+        if(node->right){
+            return minimum(node->right);
+        }
+
+        Node* cur = node, *pre = node->parent;
+        while(pre){
+            if(pre->left == cur){
+                return pre;
+            }
+            else{
+                cur = pre;
+                pre = cur->parent;
+            }
+        }
+        return nullptr;
+    }
+
+private:
+    Node* minimum(Node* node){
+        while(node->left) node = node->left;
+        return node;
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -539,7 +539,7 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | 507 | [Perfect Number](https://leetcode.com/problems/perfect-number/) | [solution](https://leetcode.com/problems/perfect-number/solution/) | [C++](0501-1000/0507-Perfect-Number/cpp-0507/) | | |
 | 508 | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum/) | [无] | [C++](0501-1000/0508-Most-Frequent-Subtree-Sum/cpp-0508/) | | |
 | 509 | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number/) | [无] | [C++](0501-1000/0509-Fibonacci-Number/cpp-0509/) | | |
-| | | | | | |
+| 510 | [Inorder Successor in BST II](https://leetcode.com/problems/inorder-successor-in-bst-ii/) | [无] | [C++](0501-1000/0510-Inorder-Successor-in-BST-II/cpp-0510/) | | |
 | 511 | Database Problem: [Link](https://github.com/liuyubobobo/Play-Leetcode-Database/) | - | - | - | - |
 | | | | | | |
 | 513 | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/) | [无] | [C++](0501-1000/0513-Find-Bottom-Left-Tree-Value/cpp-0513/) | | |
