程序实现二叉树的先序/中序/后续排序

package com.page.erchashu;

public class Tree {
    public String num;
    public Tree left;
    public Tree right;

    static Tree root = new Tree("1");
    static Tree node2 = new Tree("2");
    static Tree node3 = new Tree("3");
    static Tree node4 = new Tree("4");
    static Tree node5 = new Tree("5");
    static Tree node6 = new Tree("6");

    static {
        root.left = node2;
        root.right = node5;
        node2.left = node3;
        node2.right = node4;
        node5.right = node6;
    }

    public static void main(String[] args) {

        System.out.println("先序");
        first(root);
        System.out.println();
        System.out.println("中序");
        middle(root);
        System.out.println();
        System.out.println("后序");
        last(root);



    }


    public static void middle(Tree node) {
        if (node.left != null) {
            middle(node.left);
        }
        System.out.print(node.num);
        if (node.right != null) {
            middle(node.right);
        }
    }

    public static void last(Tree node){

    if (node.left!=null){
        last(node.left);
    }
    if (node.right!=null){
        last(node.right);
    }
        System.out.print(node.num);
}
public static  void first(Tree node){

    System.out.print(node.num);

    if (node.left!=null){
        first(node.left);
    }

    if (node.right!=null){
        first(node.right);
    }

    }


 public Tree(){

 }
 public Tree (String num){
      this.num=num;
 }
}