How do I traverse a binary tree in Java?

How do I traverse a binary tree in Java?

You can traverse a binary tree using different methods like in-order, pre-order, and post-order traversal. Which one would you like to know more about?

Can you explain in-order traversal?

In in-order traversal, you visit the left subtree first, then the root node, and finally the right subtree. Would you like to see a code example?

Yes, please provide a code example for in-order traversal.

Here's a simple Java code for in-order traversal:

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

void inOrder(Node node) {
    if (node == null) return;
    inOrder(node.left);
    System.out.print(node.data + " ");
    inOrder(node.right);
}

This will print the nodes in ascending order.

What about pre-order and post-order traversal?