刷题 | 二叉树的各种遍历java实现

package ImportantAlgorithm;



import javafx.geometry.Pos;

import java.util.ArrayDeque;

public class PreOrder {
    public static void main(String[] args) {
        TreeNode a1 = new TreeNode(5);
        TreeNode a2 = new TreeNode(1);
        TreeNode a3 = new TreeNode(2);
        TreeNode a4 = new TreeNode(0);
        a1.left = a2;
        a1.right = a3;
        a2.left = a4;
        a2.right = null;
        a3.left = null;
        a4.left = null;
        a3.right = null;
        a4.right = null;
        Pre(a1);
        In(a1);
        Post(a1);
        //PostTraverse(a1);
    }

    /*先序遍历*/
    //先访问，后入栈
    public static void Pre(TreeNode root) {
        System.out.print("先序：");
        ArrayDeque<TreeNode> deque = new ArrayDeque<>();
        if (root == null) {
            return;
        }
        System.out.print(root.val);
        deque.p