擅长:python、mysql、java
<p>根据树的表示形式,您需要某种机制来枚举节点的子节点。然后使用如下函数</p>
<pre><code>TellLevels(Root, Level):
Say "The node ", Root.Id, " has level ", Level
for Son= FirstSon(Root) to LastSon(Root)
TellLevels(Son, Level + 1)
</code></pre>
<p>并用</p>
<pre><code>TellLevels(Root, 0)
</code></pre>
<p>这仅在图具有树拓扑时有效。你知道吗</p>
<hr/>
<p><strong>避免骑车:</strong></p>
<pre><code>TellLevels(Root, Level):
Root.Visited= true
Say "The node ", Root.Id, " has level ", Level
for Son= FirstSon(Root) to LastSon(Root)
if not Son.Visited
TellLevels(Son, Level + 1)
</code></pre>