Join our newsletter for the latest updates.
Java Program to Perform the inorder tree traversal

Java Program to Perform the inorder tree traversal

In this example, we will learn to perform the inorder tree traversal in Java.

To understand this example, you should have the knowledge of the following Java programming topics:


Example: Java Program to perform inorder tree traversal

class Node {
  int item;
  Node left, right;

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

class Tree {
  // root of Tree
  Node root;

  Tree() {
  root = null;
  }

  void inOrder(Node node) {
    if (node == null)
      return;

    // traverse the left child
    inOrder(node.left);

    // traverse the root node
    System.out.print(node.item + "->");

    // traverse the right child
    inOrder(node.right);
  }


  public static void main(String[] args) {

    // create an object of Tree
    Tree tree = new Tree();

    // create nodes of tree
    tree.root = new Node(1);
    tree.root.left = new Node(12);
    tree.root.right = new Node(9);

    // create child nodes of left child
    tree.root.left.left = new Node(5);
    tree.root.left.right = new Node(6);

    System.out.println("In Order traversal");
    tree.inOrder(tree.root);
  }
}
Inorder Tree Traversal
Inorder Tree Traversal

Output

In Order traversal
5->12->6->1->9->

In the above example, we have implemented the tree data structure in Java. Here, we are performing the inorder traversal of the tree.

Recommended Reading: