And then we'll construct our tree as follows: each node, well, let me put an example here.

然后我们如下建立我们的决策树：,每一个节点，好的，让我们在这里举一个例子。

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

The point I wanted to make is that for every node, except the leaves, the leaves are the bottom of a tree in this case, are weird, right, they draw trees where the root is at the top, and the leaves are at the bottom.

你没必要看到整棵树，我想说的重点是,对每个节点来说，除了叶子节点,叶子节点指的是树的最下面的节点，电脑科学家都很奇怪,他们画树的时候根是在最上面的。

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