基于java的生成二叉树程序。可进行前序遍历、中序遍历、后序遍历-Java program based on the generation of binary tree. Can be pre-order traversal, inorder traversal, postorder traversal

二叉树的定义和前序，中序，后序，层次遍历。包括递归的写法和非递归的写法。附有部分注释！-The definition of a binary tree and preamble, inorder, postorder, level traversal. Including wording of recursive and non-recursive written. With some notes!

用JAVA构造的一颗简单的二叉树，并实现它的中序、前序、后序遍历。-JAVA constructed a simple binary tree, and its inorder, preorder, postorder traversal.

二叉树的基本功能：1.生成一棵以二叉链表存储的二叉树bt (节点树可自定义)2.用递归方法前序、中序、后序遍历bt，并以缩格形式打印bt上各结点的信息3.交换bt上的所有左右子树，并以缩格形式打印出交换前-The basic function of a binary tree: a tree in order to generate a list stored in binary binary bt (node ​ ​ tree can be customized) 2 be