Binary Tree Traversals Using Java

Get ready to embark on an exciting journey through the woods — the binary woods, that is. One example of such a task covers the concept of Binary Tree Traversals. A Binary Tree is a type of data structure in which each node has at most two children, referred to as the left child and the right child. Traversing such a structure involves visiting each node in a specific order — and Java, with its strong typing and object-oriented features, makes this task quite manageable.

Before diving deeper into the traversals, let's define a simple structure for a binary tree node in Java. Each node in a binary tree will have a value, a reference to its left child, and a reference to its right child.

Here’s how you can define a basic binary tree node class in Java:

public class TreeNode {
    int value;
    TreeNode left;
    TreeNode right;

    public TreeNode(int value) {
        this.value = value;
        this.left = null;
        this.right = null;
    }

    public TreeNode(int value, TreeNode left, TreeNode right) {
        this.value = value;
        this.left = left;
        this.right = right;
    }
}

This TreeNode class initializes a node with a given value and optional left and right children, which default to null if not provided. This structure will serve as the foundation for implementing the different binary tree traversal methods.

We have three primary ways to traverse a binary tree: Inorder (Left, Root, Right), Preorder (Root, Left, Right), and Postorder (Left, Right, Root). One way is to use recursive Inorder traversal. If a tree is not empty, we will first recursively traverse the left subtree, then visit the root, and finally, recursively traverse the right subtree. In this way, we can explore every corner of our binary landscape.

The solution might look like this:

import java.util.ArrayList;
import java.util.List;

public class BinaryTreeTraversal {

    public static List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> result = new ArrayList<>();
        inorderHelper(root, result);
        return result;
    }

    private static void inorderHelper(TreeNode node, List<Integer> result) {
        if (node == null) {
            return;
        }
        inorderHelper(node.left, result);
        result.add(node.value);
        inorderHelper(node.right, result);
    }

    public static void main(String[] args) {
        TreeNode root = new TreeNode(1, null, new TreeNode(2, new TreeNode(3), null));
        System.out.println(inorderTraversal(root));  // Output: [1, 3, 2]
    }
}