2022-05-20 update: added "Maximum Binary Tree II"

Author: fartem

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/MaximumBinaryTreeII.java

@@ -0,0 +1,38 @@
+package com.smlnskgmail.jaman.leetcodejava.medium;
+
+import com.smlnskgmail.jaman.leetcodejava.support.TreeNode;
+
+// https://leetcode.com/problems/maximum-binary-tree-ii
+public class MaximumBinaryTreeII {
+
+    private final TreeNode root;
+    private final int val;
+
+    public MaximumBinaryTreeII(TreeNode root, int val) {
+        this.root = root;
+        this.val = val;
+    }
+
+    public TreeNode solution() {
+        return insertIntoMaxTree(root, val);
+    }
+
+    private TreeNode insertIntoMaxTree(TreeNode root, int val) {
+        if (root == null) {
+            return null;
+        }
+        if (root.val < val) {
+            var node = new TreeNode(val);
+            node.left = root;
+            return node;
+        } else {
+            if (root.right != null) {
+                root.right = insertIntoMaxTree(root.right, val);
+            } else {
+                root.right = new TreeNode(val);
+            }
+        }
+        return root;
+    }
+
+}

src/test/java/com/smlnskgmail/jaman/leetcodejava/medium/MaximumBinaryTreeIITest.java

@@ -0,0 +1,43 @@
+package com.smlnskgmail.jaman.leetcodejava.medium;
+
+import com.smlnskgmail.jaman.leetcodejava.support.TreeNode;
+import org.junit.Test;
+
+import static org.junit.Assert.assertTrue;
+
+public class MaximumBinaryTreeIITest {
+
+    @Test
+    public void defaultTest() {
+        assertTrue(
+                TreeNode.areEqual(
+                        new TreeNode(
+                                5,
+                                new TreeNode(
+                                        4,
+                                        new TreeNode(1),
+                                        new TreeNode(
+                                                3,
+                                                new TreeNode(2),
+                                                null
+                                        )
+                                ),
+                                null
+                        ),
+                        new MaximumBinaryTreeII(
+                                new TreeNode(
+                                        4,
+                                        new TreeNode(1),
+                                        new TreeNode(
+                                                3,
+                                                new TreeNode(2),
+                                                null
+                                        )
+                                ),
+                                5
+                        ).solution()
+                )
+        );
+    }
+
+}