Infinite tree structure realization in programming

Tree Structure plays an important role on the structure design of the program and database. According to the analysis on the Infinite Tree Structure, the paper presents two methods to implement it based on the conventional relational database, which are called "The Node Recursion Method" and "The Level Coding Method" respectively. Also, this paper explains the two methods by some details including an example, the typical realization algorithms and the main table structure in database. Finally, the performance and efficiency of the two methods are discussed thoroughly from different areas.