二叉树的各种操作，功能有：树的建立、删除；



先序、后序、中序、层次遍历；



节点的查找，节点的插入；



兄弟的查找，父节点的查找；



计算树的深度、叶子数、节点数；



树的拷贝；



判断两个树是否相等；



判断是否是满树、完全树；-Binary tree of various operations, functions: the establishment of the tree, delete　the first sequence, after the sequence, sequence, hierarchy traversal　find the node, the node is inserted　Search Search brothers, the parent node　calculating depth of the tree leaves the number of nodes　a copy of the tree　Analyzing two trees are equal　determine whether the full tree, complete tree