preorder traversal的例句大全

for the tree drawn above the preorder traversal is dbacegf and the inorder traversal is abcdefg.

对于上述的前序遍历树DBACEGF得出的和序遍历是ABCDEFG。

At present, preorder traversal algorithm is wildly used for OID serializing.

现在普遍采用的OID序列化方法是前序算法,但是该算法代价很大.

other indices produce redundant data in the preorder or postorder traversal, this makes the cost of query much more.

有的在向前或向后遍历时产生了大量的冗余数据，从而造成查询代价较大。

there are two major approaches: the adjacency list model, and the modified preorder tree traversal algorithm.

主要有两种方法：邻接列表模型，预排序遍历树算法。）汗…这些专业术语，翻译起来真困难！

Experimental Description: Preorder tree traversal and traversal in order to determine the outcome of a tree.

实验描述: 树的前序遍历和中序遍历结果可以确定一棵树.