> For the complete documentation index, see [llms.txt](https://timmybeeflin.gitbook.io/cracking-leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/998.-maximum-binary-tree-ii.md).

# 998. Maximum Binary Tree II

[998. Maximum Binary Tree II](https://leetcode.com/problems/maximum-binary-tree-ii/)

```java
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode insertIntoMaxTree(TreeNode root, int val) {
        TreeNode node = root;
        TreeNode parent = null;
        while (node != null && val < node.val) {
            parent = node;
            node = node.right;
        }
        TreeNode newNode = new TreeNode(val);
        newNode.left = node;
        if (parent == null) {
            root = newNode;
        } else {
            parent.right = newNode;
        }
        
        return root;
    }
}
```