As you have discovered in recent problem set, it is possible to construct all subsets of a set.

正如你在最近的问题集中发现的，构建集合的所有子集是可行的。

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

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

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

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

The difference with the do while loop, as the syntax kind of suggests, is that this construct is going to do something no matter what.

作为建议的语法，do，while循环的不同之处,是这个结构不管怎么样,它会做一些事情。

哈佛公开课 - 计算机科学课程节选

So the do while construct is not as useful as the other two.

所以那个do，while，结构不像其他两个那么有用。

哈佛公开课 - 计算机科学课程节选