创建二叉树、遍历（先序、中序、后序、层序）、计算（结点数、叶子数、高度、宽度）、查找（找结点、找双亲、找孩子、找兄弟，找祖先）、判断（二叉排序树、平衡二叉树、完全二叉树）、处理（左右子树互换，销毁、删子树、插子树、复制)等功能-Create a binary tree traversal (first sequence, sequence after sequence, sequence), calculated (number of nodes, number of leaves, height, width), find (find nodes, find parents, looking for children to find the brothers, looking for ancestors), judgment (binary sort tree, balanced binary tree, complete binary tree), processing (left and right subtrees interchangeable, destroy, delete sub-tree, insert subtree copy) and other functions