English | 简体中文 | 繁體中文 | Русский язык | Français | Español | Português | Deutsch | 日本語 | 한국어 | Italiano | بالعربية

Java Basic Tutorial

Java Exception Handling

/

/

   

  
  
  
  
  
  }
}

  //
  
  
  
  }
  
    
      
    //
    
    //
     + ->
    //Traverse the right subtree
    inOrder(node.right);
  }
  public static void main(String[] args) {
    //Create a Tree object
    Tree tree = new Tree();
    //Create the tree node
    tree.root = new Node(1);
    tree.root.left = new Node(12);
    tree.root.right = new Node(9);
    //Create the left child node's child node
    tree.root.left.left = new Node(5);
    tree.root.left.right = new Node(6);
    System.out.println("Traverse in order");
    tree.inOrder(tree.root);
  }
}
Ordered Tree Traversal

Output Result

Traverse in order
5->12->6->1->9->

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

Recommended Reading: