Description: 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.
- [C] - This document, including the capacity C
- [Traversing_Graph] - Tree adjacency list representation and a
File list (Check if you may need any files):
erchashu.c
Download