How do I implement a binary tree in Java?

How do 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;
    }
}

What about the methods to insert and traverse the tree?

You can create methods like insert() for adding nodes and inOrderTraversal() for traversing the tree. Would you like to see those?

Yes, please provide the code for those methods.

Here's an example of the insert() and inOrderTraversal() methods:

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;
}

void inOrderTraversal(Node root) {
    if (root != null) {
        inOrderTraversal(root.left);
        System.out.print(root.data + " ");
        inOrderTraversal(root.right);
    }
}