Any XML document is a well-defined tree of elements and attributes, and XML queries are expressed in terms of tree traversal.
每个XML文档均是定义良好的元素和属性树，并使用树遍历来表示XML查询。
You should be familiar with the following XML-related, computer-science concepts: tree traversal, recursion, and reuse of data.
应该熟悉下列与 XML 有关的计算机科学概念：树遍历、递归和数据重用。
Runtime APIs, such as DOM, are moving towards allowing programmers to write XPath expressions rather than writing explicit tree traversal code (which can be painful).
运行时api，诸如dom，正在倾向于允许程序员编写XPath表达式而不是编写明确的树遍历代码(后者是一个痛苦的过程)。
For example, imagine you need a data structure for tree traversal and choose to write a stack.
假设你需用栈来实现遍历树的数据结构。
Recursive and non recursive implementation of binary tree traversal, the use of queues to achieve the level of binary tree traversal.
利用递归和非递归实现二叉树的中序遍历，利用队列实现二叉树的层次遍历。
Binary tree operation: create a binary tree, before traversing binary, inorder, postorder binary tree traversal.
说明：二叉树操作：建立二叉树，前序遍历二叉树、中序、后序遍历二叉树。
Binary tree operation: create a binary tree, before traversing binary, inorder, postorder binary tree traversal.
说明：二叉树操作：建立二叉树，前序遍历二叉树、中序、后序遍历二叉树。
应用推荐