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