代码包含了二叉树的创建和普通树的创建，并且有对应的前序、中序、后序遍历和对应的用队列和栈方法的遍历-The code includes the creation of the binary tree and the creation of the tree, and the corresponding pre-order, inorder, postorder traversal and traversal of the corresponding queue and stack method