送交者: 008 于 2008-02-08, 01:46:55:

回答: 就像recursive function一样，层数越多就越慢。 由 queue 于 2008-02-08, 01:14:37:

• What else can you do? if the problem is inherently recursive, Like qsort? (无内容) - steven (0 bytes) 2008-02-08, 02:06:12 (204052)
  • 1. recursion should be avoided for trees. 2. "层数越多就越慢" is - 008 (355 bytes) 2008-02-08, 02:39:56 (204054)
    • 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)

加跟贴