双向树/树的建立以及遍历(java)

刷剑指offer，刷到第八题，这个杀千刀的LeetCode的没有第八题。莫得办法只能自己写一个建立双向树（是叫这个名字吗，如有错误请指正）。如果只要树，不要子节点指向父节点，直接把指向父节点的字段以及有关的内容删除就可以了。

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class MyTree {
    private char val;
    private MyTree left;
    private MyTree right;
    private MyTree father;

    private static Map<Character, Integer> map;
    public MyTree(char val){
        this.val = val;
    }

    private static void mapCheck(char[] midOrder){
        int n = midOrder.length;
        if (map == null){
            map = new HashMap<>();
            for (int i = 0 ; i < n ; i ++){
                map.put(midOrder[i], i);
            }
        }
        return;
    }

    public static MyTree getTreeWithPreMid(char[] preOrder, char[] midOrder){
        int n = midOrder.length;
        mapCheck(midOrder);
        return BuildByPre(preOrder, midOrder, 0, n-1, 0, n-1, null);
    }

    private static MyTree BuildByPre(char[] preOrder, char[] midOrder, int pl, int pr, int ml, int mr, MyTree father){
        if (pl > pr){
            return null;
        }

        int prePos = pl;
        int midPos = map.get(preOrder[prePos]);
        int leftNum = midPos - ml;

        MyTree root = new MyTree(preOrder[prePos]);
        root.father = father;

        root.left = BuildByPre(preOrder, midOrder, pl+1, pl+leftNum, ml, midPos-1, root);
        root.right = BuildByPre(preOrder, midOrder, pl+leftNum+1, pr, midPos+1, mr, root);

        return root;
    }

    public static MyTree getTreeWithPostMid(char[] postOrder, char[] midOrder){
        int n = midOrder.length;
        mapCheck(midOrder);
        return BuildByPost(postOrder, midOrder, 0, n-1, 0, n-1, null);
    }

    private static MyTree BuildByPost(char[] postOrder, char[] midOrder, int pl, int pr, int ml, int mr, MyTree father){
        if (pl > pr){
            return null;
        }

        int postPos = pr;
        int midPos = map.get(postOrder[postPos]);
        int rightNum = mr - midPos;

        MyTree root = new MyTree(postOrder[postPos]);
        root.father = father;

        root.left = BuildByPost(postOrder, midOrder, pl, pr-rightNum-1, ml, midPos-1, root);
        root.right = BuildByPost(postOrder, midOrder, pr-rightNum, pr-1, midPos+1, mr, root);

        return root;
    }

    public List<Character> getTraversal(TraversalMethod method){
        List<Character> ans = new ArrayList<Character>();

        switch (method){
            case MID:
                midTraversal(ans, this);
                break;
            case PRE:
                preTraversal(ans, this);
                break;
            case POST:
                postTraversal(ans, this);
        }

        return ans;
    }

    private void preTraversal(List<Character> list, MyTree root){
        if (root == null){
            return;
        }

        list.add(root.val);
        preTraversal(list, root.left);
        preTraversal(list, root.right);

        return;
    }

    private void midTraversal(List<Character> list, MyTree root){
        if (root == null){
            return;
        }

        midTraversal(list, root.left);
        list.add(root.val);
        midTraversal(list, root.right);

        return;
    }

    private void postTraversal(List<Character> list, MyTree root){
        if (root == null){
            return;
        }

        postTraversal(list, root.left);
        postTraversal(list, root.right);
        list.add(root.val);

        return;
    }
}
public enum TraversalMethod {
    PRE, MID, POST
}