在计算机科学中，二叉树是每个节点最多有两个子树的树结构。通常子树被称作“左子树”（left subtree）和“右子树”（right subtree）。二叉树常被用于实现二叉查找树和二叉堆。二叉树的思想、深度、高度以及二叉树的遍历都深深影响着计算机科学的发展。
这次要利用二叉树去实现读入一个文件的单词，然后建立一棵二叉搜索树，然后输出二叉搜索树的高度、叶子树等信息，以及实现其中序遍历。利用二叉搜索树，能将大量单词很快地排好序，性能很高。(In computer science, a two tree is a tree structure with a maximum of two subtrees for each node. Usually subtrees are called "left subtree" and "right subtree". Two forked trees are often used to implement two fork search trees and two forked heaps. The thought, depth, height of the two forked tree and the traversal of the two forked tree have deeply affected the development of computer science.
This time, we use the two fork tree to realize the word that read a file, then build a two fork search tree, then output the height of two fork search tree, Ye Zishu and other information, and achieve the order traversal. Using a two fork search tree, a large number of words can be quickly arranged and the performance is very high.)