本文利用C语言实现了简单的二叉树，每个结点只保存一个整数，并且，由于非常简单，树的根结点是确定的，而不是输入的。确定根结点以后，用户输入的每一个数都被insert到树中（-999表示停止），利用深度优先的方法。建立好二 叉 树以后，分别利用深度优先（DFS）和广度优先（BFS）进行了遍历， -In this paper, a simple C language binary tree, each node only stores an integer, and, due to the very simple, is to determine the root of the tree, not imported. Determine the root after each number entered by the user are insert into the tree (-999 means stop), the use of depth-first approach. After the establishment of good binary tree, respectively, using depth-first (DFS) and breadth first (BFS) for the traverse,