...理语句包含一个查询语句,那么这个内部结构被成为查询树(QUERY TREE),如果该处理语句是一个过程,那么被成为顺序树(SEQUENCE TREE).
基于16个网页-相关网页
按先序顺序创建二叉树 void CreatBiTree
这两个函数均按照深度优先的顺序遍历树，但两者的差异在于先访问一个节点还是先访问其子节点。
Both functions walk the tree in depth-first order but they differ in whether a node is visited before or after its children.
假定一个树对象，并且想要以从左到右的顺序搜索它的叶子。
Suppose you have a tree object, and want to search its leaves in left-to-right order.
而且，令人感兴趣的是，DB2返回结果时所依照的顺序暴露了递归如何逐层地而不是采用遍历树的方法进行处理。
Further, it is interesting to note that the order in which DB2 has returned the results exposes how the recursion is processed one level at a time, instead of using a tree-walk.
应用推荐