How can I implement a binary tree in Java?

How can I implement a binary tree in Java?

To implement a binary tree in Java, you can start by creating a Node class that contains data and references to left and right children.

Can you show me a simple example of the Node class?

Sure! Here's a basic Node class:

class Node {
    int data;
    Node left, right;

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

How do I add nodes to the binary tree?

You can create an insert method that places nodes based on their value. Would you like to see an example?

Yes, please!

Here's a simple insert method:

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

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