How do I insert a node into a binary tree in Java?

How do I insert a node into a binary tree in Java?

To insert a node into a binary tree in Java, you typically need to find the correct position for the new node. Would you like a code example?

Yes, please provide a code example.

Here's a simple example:

class Node {
    int data;
    Node left, right;
    Node(int item) {
        data = item;
        left = right = null;
    }
}

class BinaryTree {
    Node root;

    void insert(int key) {
        root = insertRec(root, key);
    }

    Node insertRec(Node root, int key) {
        if (root == null) {
            root = new Node(key);
            return root;
        }
        if (key < root.data) {
            root.left = insertRec(root.left, key);
        } else if (key > root.data) {
            root.right = insertRec(root.right, key);
        }
        return root;
    }
}

This code defines a binary tree and a method to insert nodes recursively.

What if I want to insert multiple nodes at once?

You can create a loop to insert multiple nodes. For example:

int[] keys = {50, 30, 20, 40, 70, 60, 80};
for (int key : keys) {
    tree.insert(key);
}

This will insert all the keys into the binary tree.