Binary Tree Traversal Java implementation

"Paste code and test results only"

-------------------Binarytree.java------------------------------

classTree<e>{E element; Tree<E>Lchild; Tree<E>Rchild;  PublicTree (e e) {element=e; }} Public classBinaryTree {/*** The tree is as follows: * 1 */* 2 3 * \/* 4 5 6*/         Public Static voidMain (string[] args) {Tree<Integer> N1 =NewTree<integer> (1); Tree<Integer> N2 =NewTree<integer> (2); Tree<Integer> n3 =NewTree<integer> (3); Tree<Integer> N4 =NewTree<integer> (4); Tree<Integer> N5 =NewTree<integer> (5); Tree<Integer> N6 =NewTree<integer> (6); System.out.println ("Construct The Tree ..."); N2.rchild=N4; N3.lchild=N5; N3.rchild=N6; N1.lchild=N2; N1.rchild=N3; System.out.println ("Print first order traversal result:");        Firstorder (N1); System.out.println ("\ n Print the results of the sequential traversal:");        Midorder (N1); System.out.println ("\ n Print post-traversal results:");    Lastorder (N1); }         Public Static<E>voidFirstorder (tree<e>root) {        if(root!=NULL) {System.out.print (root.element+" ");            Firstorder (Root.lchild);        Firstorder (Root.rchild); }    }     Public Static<E>voidLastorder (tree<e>root) {        if(root!=NULL) {lastorder (root.lchild);            Lastorder (Root.rchild); System.out.print (Root.element+" "); }    }     Public Static<E>voidMidorder (tree<e>root) {        if(root!=NULL) {midorder (root.lchild); System.out.print (Root.element+" ");        Midorder (Root.rchild); }    }}

Output Result:

Construct the tree ... Print First Order traversal results:1 2 4 3 5 6 Print sequence traversal results:2 4 1 5 3 6 print post-order traversal results:

Binary Tree Traversal Java implementation