二叉树是计算机科学中最基本的也是最重要的树型数据结构。
Binary trees are the most fundamental and important data structures used in computer science.
本文介绍了树型结构数据在关系数据库中存储的思想和一种在网页中显示树型数据结构的方法。
A thinking about data of tree structure how to stored in relational database and a method of how about these data is displayed on web is discussed in this paper.
该算法采用人们熟悉的树型数据结构,可以较为合理地表示稀疏校验矩阵中行与列中非零元素的跳转关系。
This algorithm used the data of tree structure, and could more reasonably the skipping relations of the non-zero elements in the rows and lines of the sparse check matrix.
应用推荐