Introduction - If you have any usage issues, please Google them yourself
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