这两个函数均按照深度优先的顺序遍历树，但两者的差异在于先访问一个节点还是先访问其子节点。

Both functions walk the tree in depth-first order but they differ in whether a node is visited before or after its children.

youdao

对于大多数操作，红黑树的执行时间为 O(log n)，而以前的调度程序通过具有固定优先级的优先级数组使用 O(1)。

The red-black tree is O(log n) in time for most operations, while the previous scheduler employed O(1), using a priority array with a fixed number of priorities.

youdao

这个示例并不演示如何配置跨越树及其所需的交换机优先级。

The example does not demonstrate how to configure spanning trees and switch priority for spanning trees that may be required.

youdao

To be systematic, I'm going to build this tree depth-first left-first.

为了保持系统性，我将要把这棵树设置,为深度优先和左边优先。

麻省理工公开课 - 计算机科学及编程导论课程节选