In tree traversal, preorder visits the root node first.

在树的遍历中，前序遍历先访问根节点。

Open registration for the client node using the root node administration feature.

为客户节点开放注册使用根节点的管理工具(组件).

Each document must have a unique first element, the root node.

每个文档必须有一个唯一的首元素, 即根节点.

Now that we are at the root node, we can start our descent down to the desired key.

现在我们在根节点是，我们可以开始我们的后裔到所需的关键。

This paper gives the algorithms inseting root-node and binary tree in all threaded binary tree.

给出了在全线索二叉树中插入结点和二叉树的算法，然后阐述了这种运算的特点。

In the problems of minimax tree search, what we are looking for is often the optimal branch at the root node.

在极大极小树搜索时，我们经常寻找的是根节点的最优分支。