Xref: utzoo comp.edu:3619 uw.general:1839
Newsgroups: comp.edu,uw.general
Path: utzoo!utgpu!watserv1!maytag!aftermath!water!nmouawad
From: nmouawad@water.waterloo.edu (Naji Mouawad)
Subject: Re: Recursion?
Message-ID: <1990Oct7.015406.4948@water.waterloo.edu>
Organization: University of Waterloo
References: <1990Oct5.101354.593@contact.uucp> <1990Oct5.173551.5130@Neon.Stanford.EDU>
Distribution: na
Date: Sun, 7 Oct 90 01:54:06 GMT
Lines: 16

Speaking of recursion, here's a little thing to ponder ...

Traversing an ordered binary tree recursively is easy (Depth first say)
Doing the same job using a stack is equally easy (takes more time to
write down).
How's about traversing a tree with a constant number of pointers ?

Heh, heh ...

---Naji.

-- 
         ---------------+-------------------------------------------
        | Naji Mouawad  |       nmouawad@water.waterloo.edu         |
        |  University   |-------------------------------------------|
        | Of Waterloo   | "Thanks God, we cannot prove He Exists."  |