Tree' s data structure based on the table of relational database
Yong Wei · Journal of Shenzhen Institute of Information Technology · 2006
Due to more and more relational database technology's applications, studying external data structure through relational algebra or SQL has its practical significance. This paper deals with not only a tree' s external data structure based on relational database' s table, but also query method through relational algebra or structured query language.(SQL) Then the algorithm of traversing the binary tree, including preorder, inorder and postorder, in Java language has been implemented. Binary trees are often used for sorting information: each node of the binary search tree contains a key, with values less than that key added to one subtree and values greater than that key added to the other. Finally, the paper solves the practical problem mentioned at the beginning.