<p>如果您使用的是python2.6,您是否尝试过使用psyco模块?它有时可以显著提高代码的速度。在</p>
<p>你考虑过递归数据结构:列表吗?在</p>
<p>您的示例也是标准列表:</p>
<blockquote>
<p>[1, <a href="http://www.google.fi/url?sa=t&source=web&cd=1&ved=0CBYQFjAA&url=http%3A%2F%2Fdocs.python.org%2Flibrary%2Fheapq.html&ei=4TBQTNaYKMOUOIDDoYkB&usg=AFQjCNETIyH2tLmCy033mmStzvuKyeHPpg&sig2=EIg5McBcPgroTk6msmkiBA" rel="nofollow noreferrer">2</a>, [3, [4],[5]]]</p>
</blockquote>
<p>或者</p>
<blockquote>
<p>[1, [2, None, None], [3, [4, None, None],[5, None, None]]]</p>
</blockquote>
<p>由我的<a href="https://stackoverflow.com/questions/3319540/pretty-print-module-extension-for-giving-a-table-of-results-etc">pretty printer</a>:</p>
<pre><code>[1,
[2, None, None],
[3,
[4, None, None],
[5, None, None]]]
</code></pre>
<p>子树已经准备好了,需要花费一些时间将值插入到右树中。同样值得检查一下<a href="http://www.google.fi/url?sa=t&source=web&cd=1&ved=0CBYQFjAA&url=http%3A%2F%2Fdocs.python.org%2Flibrary%2Fheapq.html&ei=4TBQTNaYKMOUOIDDoYkB&usg=AFQjCNETIyH2tLmCy033mmStzvuKyeHPpg&sig2=EIg5McBcPgroTk6msmkiBA" rel="nofollow noreferrer">heapq module</a>是否符合您的需要。在</p>
<p>另外,Guido自己也对<a href="http://python.org/doc/essays/graphs.html" rel="nofollow noreferrer">http://python.org/doc/essays/graphs.html</a>中的遍历和树给出了一些见解,也许您已经知道了。在</p>
<p>下面是一些看起来很高级的树,实际上是为Python建议的基本列表类型替换,但在该函数中被拒绝了。<a href="http://pypi.python.org/pypi/blist" rel="nofollow noreferrer">Blist module</a></p>