二叉树遍历(前序,中序,后序)递归

private static class TreeNode{
        private int val;
        private TreeNode left;
        private TreeNode right;
        private int deep;

        public TreeNode(int val, TreeNode left, TreeNode right) {
            this.val = val;
            this.left = left;
            this.right = right;
        }

        @Override
        public String toString() {
            return "TreeNode{" +
                    "val=" + val +
                    ", left=" + left +
                    ", right=" + right +
                    '}';
        }
    }

    public static void main(String[] args) {
        TreeNode node7 = new TreeNode(7, null, null);
        TreeNode node6 = new TreeNode(6, node7, null);
        TreeNode node5 = new TreeNode(5, null, null);
        TreeNode node4 = new TreeNode(4, null, null);
        TreeNode node3 = new TreeNode(3, node6, null);
        TreeNode node2 = new TreeNode(2, node4, node5);
        TreeNode node1 = new TreeNode(1, node2, node3);
        preorder(node1);
    }

    //前序
    public static void preorder(TreeNode node) {
        if (node == null) {
            return;
        }
//        System.out.print(node.val);//前序遍历,第一次成为顶点时
        preorder(node.left);
//        System.out.print(node.val);//中序遍历,第一次成为顶点时
        preorder(node.right);
        System.out.print(node.val);//后序遍历,第一次成为顶点时
    }