二叉树是计算机科学中最基本的也是最重要的树型数据结构。
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.
其次，将BOM的各种数据结构进行分析，选择了二叉树表示型的数据结构来存储bom，同时利用二叉树型的BOM实现从核心企业到节点企业的任务分解。
Next, it analyzed various kinds of data structure of BOM and chose binary tree as the data structure to save BOM, and realize duty decomposition from the core enterprise to the node enterprise.
数据结构中的一种树型结构的集合。
接着分析了联锁表的数据组织结构，并以玉剑车站为例重点阐述了以二叉树型站场数据结构自动生成联锁表的原理和实现方法。
Then the dissertation analyzes the structure of the interlock relation table, and it expatiates the principium and realization method of interlocking table 'automatic generation.
接着分析了联锁表的数据组织结构，并以玉剑车站为例重点阐述了以二叉树型站场数据结构自动生成联锁表的原理和实现方法。
Then the dissertation analyzes the structure of the interlock relation table, and it expatiates the principium and realization method of interlocking table 'automatic generation.
应用推荐