add 998

Author: luliyucoordinate

README.md

@@ -339,4 +339,5 @@ LeetCode
 |0994|[Rotting Oranges](https://leetcode.com/problems/rotting-oranges/) | c | [c++](./src/0994-Rotting-Oranges/0994.cpp) |[python](./src/0994-Rotting-Oranges/0994.py)|||Easy|
 |0995|[Minimum Number of K Consecutive Bit Flips](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/) | c | [c++](./src/0995-Minimum-Number-of-K-Consecutive-Bit-Flips/0995.cpp) |[python](./src/0995-Minimum-Number-of-K-Consecutive-Bit-Flips/0995.py)|||Hard|
 |0996|[Number of Squareful Arrays](https://leetcode.com/problems/number-of-squareful-arrays/) | c | [c++](./src/0996-Number-of-Squareful-Arrays/0996.cpp) |[python](./src/0996-Number-of-Squareful-Arrays/0996.py)|||Hard|
-|0997|[Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/) | c | [c++](./src/0997-Find-the-Town-Judge/0997.cpp) |[python](./src/0997-Find-the-Town-Judge/0997.py)|||Easy|
+|0997|[Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/) | c | [c++](./src/0997-Find-the-Town-Judge/0997.cpp) |[python](./src/0997-Find-the-Town-Judge/0997.py)|||Easy|
+|0998|[Maximum Binary Tree II](https://leetcode.com/problems/maximum-binary-tree-ii/) | c | [c++](./src/0998-Maximum-Binary-Tree-II/0998.cpp) |[python](./src/0998-Maximum-Binary-Tree-II/0998.py)|||Medium|

src/0998-Maximum-Binary-Tree-II/0998.cpp

@@ -0,0 +1,22 @@
+static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
+class Solution 
+{
+public:
+    TreeNode* insertIntoMaxTree(TreeNode* root, int val) 
+    {
+        if (root->val < val)
+        {
+            TreeNode* res = new TreeNode(val);
+            res->left = root;
+            return res;
+        }
+        
+        if (root->right != nullptr) root->right = insertIntoMaxTree(root->right, val);
+        else
+        {
+            TreeNode* res = new TreeNode(val);
+            root->right = res;
+        }
+        return root;
+    }
+};

src/0998-Maximum-Binary-Tree-II/0998.py

@@ -0,0 +1,13 @@
+class Solution:
+    def insertIntoMaxTree(self, root: TreeNode, val: int) -> TreeNode:
+        if root.val < val:
+            tmp = TreeNode(val)
+            tmp.left = root
+            return tmp
+        
+        if root.right:
+            root.right = self.insertIntoMaxTree(root.right, val)
+        else:
+            tmp = TreeNode(val)
+            root.right = tmp
+        return root