Write a Java source code named TreeOrder.java to first store the following tree (left), where each node is represented by the private class Node (right), and then implement the functions of PreOrder, InOrder, and PostOrder and output the result of each type of order on the tree.

[20] 2. Write a Java source code named Treeorder.java to first store the following tree (eft, where each node is represented by the private class Node (right), and then implement the functions of Preorder, Inorder, and Postorder and output the result of each type of order on the tree. left parent val right root 1 12 19 private class Node 10 int ID int Data 13 15 int Parent; int Left; int Right; 14 18