1. recursion should be avoided for trees. 2. "层数越多就越慢" is

送交者: 008 于 2008-02-08, 02:39:56:

回答: What else can you do? if the problem is inherently recursive, Like qsort? 由 steven 于 2008-02-08, 02:06:12:

1. recursion should be avoided for trees. 2. "层数越多就越慢" is not necessarily true for trees, because more nodes on each layer will slow it down also.
3. I'll use recursion for a problem that is inherently recursive. Actually I won't have much chance to encounter a problem that requires a data structure more complicated than an array.

所有跟贴:

I was trying to guide them to the difference between recursive - steven (269 bytes) 2008-02-08, 15:40:46 (204147)
by using a bookkeeping stack data structure - wasguru (111 bytes) 2008-02-08, 15:08:42 (204139)
how do you avoid recursion when you deal with tree? (无内容) - steven (0 bytes) 2008-02-08, 10:10:19 (204081)

加跟贴